๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of a hypermap

โœ Scribed by A. Machi'

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
224 KB
Volume
42
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the complexity of task allocation
On the complexity of task allocation
โœ A. Schoneveld; J. F. de Ronde; P. M. A. Sloot ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 134 KB ๐Ÿ‘ 3 views

A detailed study is presented on the combinatorial optimization problem of allocating parallel tasks to a parallel computer. Depending on two application/machine-specific parameters, both a sequential and a parallel optimal allocation phase are shown to exist. A sudden "phase" transition is observed

On the complexity of circulations
On the complexity of circulations
โœ Esther M Arkin; Christos H Papadimitriou ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 703 KB
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