Hard satisfiable instances for DPLL-type algorithms (Q2577593): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:17, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hard satisfiable instances for DPLL-type algorithms |
scientific article |
Statements
Hard satisfiable instances for DPLL-type algorithms (English)
0 references
3 January 2006
0 references
propositional satisfiability problem
0 references
