New upper bound for the \#3-SAT problem (Q2380029)
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: New upper bound for the \#3-SAT problem |
scientific article; zbMATH DE number 5686462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New upper bound for the \#3-SAT problem |
scientific article; zbMATH DE number 5686462 |
Statements
New upper bound for the \#3-SAT problem (English)
0 references
24 March 2010
0 references
analysis of algorithms
0 references
satisfiability
0 references
counting solutions
0 references
0.8302582502365112
0 references
0.8248776197433472
0 references
0.8170097470283508
0 references
0.8102831244468689
0 references
