Nondeterministic polynomial time versus nondeterministic logarithmic space: Time-space tradeoffs for satisfiability

Authors
  • L. Fortnow
Publication date 1997
Book title Proceedings of the 12th IEEE Conference on Computational Complexity
Pages (from-to) 52-60
Publisher New York: IEEE
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Document type Chapter
Permalink to this page
Back