Complete problems for deterministic polynomial time
- 31 October 1976
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 3 (1), 105-117
- https://doi.org/10.1016/0304-3975(76)90068-2
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- A combinatorial problem which is complete in polynomial spacePublished by Association for Computing Machinery (ACM) ,1975
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974
- Unit Refutations and Horn SetsJournal of the ACM, 1974
- A characterization of log-space computable functionsACM SIGACT News, 1973
- Path systems and language recognitionPublished by Association for Computing Machinery (ACM) ,1970
- Recognition and parsing of context-free languages in time n3Information and Control, 1967