A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for...

SIAM Journal on Computing 1981 / 08 Vol. 10; Iss. 3

A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems

Schroeppel, Richard, Shamir, Adi
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
10
Language:
english
Journal:
SIAM Journal on Computing
DOI:
10.1137/0210033
Date:
August, 1981
File:
PDF, 1.11 MB
english, 1981
Conversion to is in progress
Conversion to is failed