The bounded arithmetic hierarchy
Open Access
- 1 January 1978
- journal article
- Published by Elsevier in Information and Control
- Vol. 36 (1) , 102-117
- https://doi.org/10.1016/s0019-9958(78)90257-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- Small Grzegorczyk classes and limited minimumMathematical Logic Quarterly, 1975
- Quasi-realtime languagesTheory of Computing Systems, 1970
- Context-free languages and rudimentary attributesTheory of Computing Systems, 1969
- Toward a Theory of EnumerationsJournal of the ACM, 1969
- Classes of automata and transitive closureInformation and Control, 1968
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- Classes of predictably computable functionsTransactions of the American Mathematical Society, 1963