New algorithms for exact satisfiability (Q1770407)
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 algorithms for exact satisfiability |
scientific article; zbMATH DE number 2153200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New algorithms for exact satisfiability |
scientific article; zbMATH DE number 2153200 |
Statements
New algorithms for exact satisfiability (English)
0 references
6 April 2005
0 references
Exact Satisfiability
0 references
Exact 3-Satisfiability
0 references
Exact solution
0 references
Branch-and-reduce algorithm
0 references
Exponential-time algorithm
0 references
0.8918740153312683
0 references
0.8879273533821106
0 references
0.8684669733047485
0 references
0.8658588528633118
0 references
0.8629076480865479
0 references
