Computational complexity of real functions
- 31 July 1982
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 20 (3), 323-352
- https://doi.org/10.1016/s0304-3975(82)80003-0
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The maximum value problem and NP real numbersJournal of Computer and System Sciences, 1982
- A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex PlaneJournal of the ACM, 1978
- An Exact Method for Finding the Roots of a Complex PolynomialACM Transactions on Mathematical Software, 1976
- Analysis in the Computable Number FieldJournal of the ACM, 1968
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- On the definitions of computable real continuous functionsFundamenta Mathematicae, 1957
- On computable sequencesFundamenta Mathematicae, 1957
- Criteria of constructibility for real numbersThe Journal of Symbolic Logic, 1953
- Nicht konstruktiv beweisbare Sätze der AnalysisThe Journal of Symbolic Logic, 1949