Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\) (Q1777401)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2168191
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\) |
scientific article; zbMATH DE number 2168191 |
Statements
Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\) (English)
0 references
13 May 2005
0 references
exact satisfiability
0 references
autonomous clause pattern
0 references
formula graph
0 references
perfect matching
0 references
NP-completeness
0 references
0.8940811157226562
0 references
0.8658588528633118
0 references
0.8317195177078247
0 references
0.8249438405036926
0 references
