Space-time complexity in nonlinear optics
β Scribed by J.V. Moloney; P.K. Jakobsen; J. Lega; S.G. Wenden; A.C. Newell
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 578 KB
- Volume
- 68
- Category
- Article
- ISSN
- 0167-2789
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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,
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