Author:
Brattka Vasco,Ziegler Martin
Reference15 articles.
1. L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer, New York 1998.
2. V. Brattka and P. Hertling, Feasible real random access machines, J. Complexity
14 (1998) 490–526.
3. V. Brattka and K. Weihrauch, Computability on subsets of Euclidean space I: Closed and compact subsets, Theoret. Comp. Sci.
219 (1999) 65–93.
4. A. Grzegorczyk, On the definitions of computable real continuous functions, Fund. Math.
44 (1957) 61–71.
5. H. Kamo, K. Kawamura, and I. Takeuti, Computational complexity of fractal sets, Real Analysis Exchange
26 (2000/01) 773–793.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献