CNF-Satisfiability Test by Counting and Polynomial Average Time (Q3829072)
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: CNF-Satisfiability Test by Counting and Polynomial Average Time |
scientific article; zbMATH DE number 4104388
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | CNF-Satisfiability Test by Counting and Polynomial Average Time |
scientific article; zbMATH DE number 4104388 |
Statements
CNF-Satisfiability Test by Counting and Polynomial Average Time (English)
0 references
1989
0 references
CNF SAT
0 references
average time
0 references
independent sets
0 references
backtracking
0 references
0.8755741119384766
0 references
0.8556205034255981
0 references
0.8532118201255798
0 references
0.8418891429901123
0 references
