k-SAT Is No Harder Than Decision-Unique-k-SAT (Q3392942)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: k-SAT Is No Harder Than Decision-Unique-k-SAT |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | k-SAT Is No Harder Than Decision-Unique-k-SAT |
scientific article |
Statements
k-SAT Is No Harder Than Decision-Unique-k-SAT (English)
0 references
18 August 2009
0 references
\(k\)-SAT
0 references
unique satisfiability
0 references
exponential complexity
0 references
quantified Boolean formulas
0 references
hitting set
0 references
independent set
0 references
