𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Space-time complexity in optical computing

✍ Scribed by H. J. Caulfield

Book ID
105404251
Publisher
Springer US
Year
1991
Tongue
English
Weight
298 KB
Volume
2
Category
Article
ISSN
0923-6082

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Space-time complexity in nonlinear optic
Space-time complexity in nonlinear optics
✍ J.V. Moloney; P.K. Jakobsen; J. Lega; S.G. Wenden; A.C. Newell πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 578 KB
Time-Space Tradeoffs in Algebraic Comple
Time-Space Tradeoffs in Algebraic Complexity Theory
✍ M. Aldaz; J. Heintz; G. Matera; J.L. MontaΓ±a; L.M. Pardo πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 294 KB

We exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial evaluation procedures given by straight-line programs. From the tradeoff results obtained by this method we deduce lower space bounds for polynomial evaluation procedures running in optimal nonscalar time. Time,

Space–time complexity and multifractal p
Space–time complexity and multifractal predictability
✍ Daniel Schertzer; Shaun Lovejoy πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 339 KB

Time complexity is associated with sensitive dependence on initial conditions and severe intrinsic predictability limits, in particular, the 'butter y e ect' paradigm: an exponential error growth and a corresponding characteristic predictability time. This was believed to be the universal long-time