The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (Q2475410): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:18, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs |
scientific article |
Statements
The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (English)
0 references
11 March 2008
0 references
satisfiability
0 references
unique satisfiability
0 references
\(k\)-SAT
0 references
subexponential time reduction
0 references
isolation lemma
0 references
