On the cost of uniform and nonuniform algorithms

Theoretical Computer Science

Volumn 219, Issue 1-2, 1999, Pages 301-318

  Novak, Erich ^a   Woźniakowski, Henryk ^b,c  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

^b Department of Earth and Environmental Sciences   (United States)

^c UNIVERSITY OF WARSAW   (Poland)

Author keywords

Continuous problems and algorithms; Information based complexity; Uniform algorithms

Indexed keywords

EID: 0008805499     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00293-X     Document Type: Article

References (6)

1. L. Blum, M. Shub, S. Smale, On a theory of computation and complexity over the real numbers: NP completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21 (1989) 1-46.
2. N. Bourbaki, Algèbre, Ch. V, Hermann, Paris, 1959.
3. A. Hemmerling Computability of string functions over algebraic structures, Math. Logic Quart. 44 (1998) 1-44.
4. E. Novak, The real number model in numerical analysis, J. Complexity 11 (1995) 57-73.
5. E. Novak, H. Woźniakowski, Topological complexity of zero finding, J. Complexity 12 (1996) 380-400.
6. J.F. Traub, G.W. Wasilkowski, H. Woźniakowski, Information-Based Complexity, Academic Press, New York, 1988.