Complete problems for deterministic polynomial time
Neil Deaton Jones, William T. Laaser · Theoretical Computer Science · 1976
Cited by 279 works. doi:10.1016/0304-3975(76)90068-2
Authors
References
- Reducibility among Combinatorial Problems
- The complexity of theorem-proving procedures
- Complexity of Computer Computations
- Formal Languages and Their Relation to Automata
- Formal Languages and their Relation to Automata
- Symbolic Logic and Mechanical Theorem Proving
- Recognition and parsing of context-free languages in time n3
- Word problems requiring exponential time(Preliminary Report)
- Space-bounded reducibility among combinatorial problems
- Unit Refutations and Horn Sets