Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253)
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: Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search |
scientific article; zbMATH DE number 6348504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search |
scientific article; zbMATH DE number 6348504 |
Statements
Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (English)
0 references
26 September 2014
0 references
Boolean satisfiability
0 references
backdoor sets
0 references
Horn
0 references
RHorn
0 references
clause learning
0 references
search
0 references
0 references
0.9118967652320862
0 references
0.843173623085022
0 references
0.822380542755127
0 references
0.7939243912696838
0 references
0.7802838683128357
0 references
