On the limit of branching rules for hard random unsatisfiable 3-SAT (Q1408384)
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: On the limit of branching rules for hard random unsatisfiable 3-SAT |
scientific article; zbMATH DE number 1981511
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the limit of branching rules for hard random unsatisfiable 3-SAT |
scientific article; zbMATH DE number 1981511 |
Statements
On the limit of branching rules for hard random unsatisfiable 3-SAT (English)
0 references
15 September 2003
0 references
Branching heuristics
0 references
Davis-Logemann-Loveland procedure
0 references
Minimum search tree size
0 references
SAT
0 references
