A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
Work
Year: 1981
Type: article
Source: SIAM Journal on Computing
Authors Richard Schroeppel, Adi Shamir
Cites: 5
Cited by: 180
Related to: 10
FWCI: 0.693
Citation percentile (by year/subfield): 98.53
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed