A threshold for a polynomial solution of \#2SAT (Q2892663)
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 6047763
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A threshold for a polynomial solution of \#2SAT |
scientific article; zbMATH DE number 6047763 |
Statements
19 June 2012
0 references
\#2SAT problem
0 references
branch-bound algorithm
0 references
polynomial thresholds
0 references
efficient counting
0 references
0.87397516
0 references
0.8628428
0 references
0 references
0 references
0.8518462
0 references
0 references
0 references
0.8507972
0 references
0.84946233
0 references
0.8478869
0 references
A threshold for a polynomial solution of \#2SAT (English)
0 references
