Why almost all satisfiable k-CNF formulas are easy (Q3576756)
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: Why almost all satisfiable k-CNF formulas are easy |
scientific article; zbMATH DE number 5763310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Why almost all satisfiable k-CNF formulas are easy |
scientific article; zbMATH DE number 5763310 |
Statements
2 August 2010
0 references
computational and structural complexity
0 references
algorithms and data structures
0 references
message passing algorithms
0 references
SAT
0 references
0.8852053284645081
0 references
0.8613259196281433
0 references
0.8577262163162231
0 references
0.8573331832885742
0 references
