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

A T S^2 = O(2^n) Time/Space Tradeoff for Certain NP-Complete Problems Richard Schroeppel Adi Shamir 328-336 conf/focs/FOCS20 1979 FOCS db/conf/focs/focs79.html#SchroeppelS79