The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (Q2475410): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2007.06.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092928619 / rank | |||
Normal rank | |||
Revision as of 21:42, 19 March 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
