Storage requirements for deterministic polynomialtime recognizable languages
Authors:
- 1 August 1976
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 13 (1) , 25-37
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Complete Register Allocation ProblemsSIAM Journal on Computing, 1975
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974
- Comparing complexity classesJournal of Computer and System Sciences, 1974
- Characterizations of flowchartable recursionsJournal of Computer and System Sciences, 1973
- Recognition and parsing of context-free languages in time n3Information and Control, 1967
- Serial compilation and the 1401 FORTRAN compilerIBM Systems Journal, 1965