A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems (Q3912012): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:59, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems |
scientific article |
Statements
A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems (English)
0 references
1981
0 references
exact satisfiability
0 references
set covering
0 references
knapsack problem
0 references
Merkle-Hellman cryptosystem
0 references
