Transformational methods and their application to complexity problems
- 1 March 1976
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 6 (1) , 95-108
- https://doi.org/10.1007/bf00263746
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Postscript about NP-hard problemsACM SIGACT News, 1974
- On The Structure of Complexity ClassesPublished by Springer Nature ,1974
- Characterizations of Time-Bounded Computations by Limited Primitive RecursionPublished by Springer Nature ,1974
- Maze recognizing automata and nondeterministic tape complexityJournal of Computer and System Sciences, 1973
- On two-way multihead automataJournal of Computer and System Sciences, 1973
- A note on multihead automata and context-sensitive languagesActa Informatica, 1973
- On non-determinancy in simple computing devicesActa Informatica, 1972
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Memory bounds for recognition of context-free and context-sensitive languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965