A T S^2 = O(2^n) Time/Space Tradeoff for Certain NP-Complete Problems

Richard Schroeppel, Adi Shamir. A T S^2 = O(2^n) Time/Space Tradeoff for Certain NP-Complete Problems. In 20th Annual Symposium on Foundations of Computer Science, 29-31 October 1979, San Juan, Puerto Rico. pages 328-336, IEEE, 1979.

Abstract

Abstract is missing.