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

Lower bounds for the approximative complexity

โœ Scribed by Bernhard Griesser

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
440 KB
Volume
46
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Complexity Lower Bounds for Approximatio
Complexity Lower Bounds for Approximation Algebraic Computation Trees
โœ Felipe Cucker; Dima Grigoriev ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 159 KB

We prove lower bounds for approximate computations of piecewise polynomial functions which, in particular, apply for round-off computations of such functions.

Some Lower Bounds for the Complexity of
Some Lower Bounds for the Complexity of Continuation Methods
โœ Jean-Pierre Dedieu; Steve Smale ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 222 KB

In this note we consider the zero-finding problem for a homogeneous polynomial system, The well-determined (m=n) and underdetermined (m<n) cases are considered together. We also let D=max d i , d=(d 1 , ..., d m ), and The projective Newton method has been introduced by Shub in [6] and is defined

Lower bounds on the area complexity of B
Lower bounds on the area complexity of Boolean circuits
โœ Juraj Hromkoviฤ; Sergej A. Loลพkin; Andrej I. Rybko; Alexander A. Sapoลพenko; Nade ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1001 KB