PURL: a new polynomial-time solvable class of satisfiability (Q3606145)
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: PURL: a new polynomial-time solvable class of satisfiability |
scientific article; zbMATH DE number 5519222
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PURL: a new polynomial-time solvable class of satisfiability |
scientific article; zbMATH DE number 5519222 |
Statements
26 February 2009
0 references
SAT
0 references
satisfiability
0 references
CNF-formula
0 references
0.7834383249282837
0 references
0.7721308469772339
0 references
0.7721308469772339
0 references
0.7651904821395874
0 references
0.7640208005905151
0 references
