Storage requirements for deterministic polynomialtime recognizable languages
Stephen A Cook, Ravi Sethi · Journal of Computer and System Sciences · 1976
Cited by 97 works. doi:10.1016/s0022-0000(76)80048-7
Authors
References
- Recognition and parsing of context-free languages in time n3
- Memory bounds for recognition of context-free and context-sensitive languages
- Comparative schematology
- Complete problems for deterministic polynomial time
- Complete Register Allocation Problems
- An observation on time-storage trade off
- Record of the Project MAC conference on concurrent systems and parallel computation
- Characterizations of flowchartable recursions
- Comparing complexity classes
- Serial compilation and the 1401 FORTRAN compiler