Nondeterministic Polynomial Time versus Nondeterministic Logartithmic Space: Time-Space Tradeoffs for Satisfiability. Fortnow, L. In Proceedings of the 12th IEEE Conference on Computational Complexity, pages 52-60. IEEE, New York, 1997.
Nondeterministic Polynomial Time versus Nondeterministic Logartithmic Space: Time-Space Tradeoffs for Satisfiability [link]Paper  Nondeterministic Polynomial Time versus Nondeterministic Logartithmic Space: Time-Space Tradeoffs for Satisfiability [pdf]Paper  doi  bibtex   

Downloads: 0