On the Structure of Feasible Computations
- 1 January 1976
- book chapter
- Published by Elsevier
- Vol. 14, 1-43
- https://doi.org/10.1016/s0065-2458(08)60449-0
Abstract
No abstract availableKeywords
Funding Information
- Universidade Estadual de Campinas
- National Science Foundation (70/755, DCR75-09433, GJ-33171X)
- Fundação de Amparo à Pesquisa do Estado de São Paulo
This publication has 10 references indexed in Scilit:
- Comparing complexity classesJournal of Computer and System Sciences, 1974
- On the time and tape complexity of languages IPublished by Association for Computing Machinery (ACM) ,1973
- An Overview of the Theory of Computational ComplexityJournal of the ACM, 1971
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Form and Content in Computer Science (1970 ACM turing lecture)Journal of the ACM, 1970
- Two memory bounds for the recognition of primes by automataTheory of Computing Systems, 1969
- On the Recognition of Primes by AutomataJournal of the ACM, 1968
- Classes of languages and linear-bounded automataInformation and Control, 1964
- Three theorems on phrase structure grammars of type 1Information and Control, 1963
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960