Hard satisfiable instances for DPLL-type algorithms (Q2577593): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57101178, #quickstatements; #temporary_batch_1707149277123 |
Removed claim: author (P16): Item:Q255274 |
||
| Property / author | |||
| Property / author: Sergey I. Nikolenko / rank | |||
Revision as of 03:05, 12 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
