𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of multilinear problems in the average case setting

✍ Scribed by Tomasz Jackowski

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
960 KB
Volume
7
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Average-case complexity of shortest-path
Average-case complexity of shortest-paths problems in the vertex-potential model
✍ Colin Cooper; Alan Frieze; Kurt Mehlhorn; Volker Priebe πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 146 KB πŸ‘ 2 views

We study the average-case complexity of shortest-paths problems in the vertexpotential model. The vertex-potential model is a family of probability distributions on complete directed graphs with arbitrary real edge lengths, but without negative cycles. We show that on a graph with n vertices and wit

On the average complexity of multivariat
On the average complexity of multivariate problems
✍ A Papageorgiou; G.W Wasilkowski πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 904 KB

We study the average complexity of linear problems, on a separable Banach space equipped with an orthogonally invariant measure CL. The error and the cost of the algorithms are defined on the average. We exhibit an information operator which is optimal among any linear information operators. We appl