Author:
Müller Norbert,Ziegler Martin
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Brattka, V., Hertling, P.: Feasible real random access machines. Journal of Complexity 14(4), 490–526 (1998)
2. Brattka, V., Weihrauch, K.: Computability on Subsets of Euclidean Space I: Closed and Compact Subsets. Theoretical Computer Science 219, 65–93 (1999)
3. Kawamura, A., Müller, N., Rösnick, C., Ziegler, M.: Computational Benefit of Smoothness: Rigorous Parameterized Complexity Analysis in High-Precision Numerics of Operators on Gevrey’s Hierarchy (submitted)
4. Ko, K.-I.: Computational Complexity of Real Functions. Birkhäuser (1991)
5. Ko, K.-I.: Polynomial-Time Computability in Analysis. In: Ershov, Y.L., et al. (eds.) Handbook of Recursive Mathematics, vol. 2, pp. 1271–1317 (1998)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computing Periods $$\ldots $$;WALCOM: Algorithms and Computation;2018