Bounded queries in recursion theory: a survey
- 10 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 13, 62-78
- https://doi.org/10.1109/sct.1991.160245
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- On the complexity of finding the chromatic number of a recursive graph II: the unbounded caseAnnals of Pure and Applied Logic, 1989
- On the complexity of finding the chromatic number of a recursive graph I: the bounded caseAnnals of Pure and Applied Logic, 1989
- A cardinality version of Beigel's nonspeedup theoremThe Journal of Symbolic Logic, 1989
- The complexity of optimization problemsJournal of Computer and System Sciences, 1988
- The complexity of promise problems with applications to public-key cryptographyInformation and Control, 1984
- Analogues of semirecursive sets and effective reducibilities to the study of NP complexityInformation and Control, 1982
- Hierarchies of sets and degrees below 0′Published by Springer Nature ,1981
- Semirecursive sets and positive reducibilityTransactions of the American Mathematical Society, 1968
- The Degrees of Hyperimmune SetsMathematical Logic Quarterly, 1968
- Trial and error predicates and the solution to a problem of MostowskiThe Journal of Symbolic Logic, 1965