Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SATLIB / rank | |||
Normal rank | |||
Revision as of 05:53, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search |
scientific article |
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
