On the definitions of some complexity classes of real numbers
- 1 December 1983
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 16 (1) , 95-109
- https://doi.org/10.1007/bf01744572
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Computational complexity of real functionsTheoretical Computer Science, 1982
- The maximum value problem and NP real numbersJournal of Computer and System Sciences, 1982
- Some observations on NP real numbers and P-selective setsJournal of Computer and System Sciences, 1981
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNPTheory of Computing Systems, 1979
- Separating Nondeterministic Time Complexity ClassesJournal of the ACM, 1978
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- Tally languages and complexity classesInformation and Control, 1974
- On computable sequencesFundamenta Mathematicae, 1957
- Recursive real numbersProceedings of the American Mathematical Society, 1954
- Nicht konstruktiv beweisbare Sätze der AnalysisThe Journal of Symbolic Logic, 1949