Toward leaner binary-clause reasoning in a satisfiability solver (Q1777406)
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: Toward leaner binary-clause reasoning in a satisfiability solver |
scientific article; zbMATH DE number 2168196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Toward leaner binary-clause reasoning in a satisfiability solver |
scientific article; zbMATH DE number 2168196 |
Statements
Toward leaner binary-clause reasoning in a satisfiability solver (English)
0 references
13 May 2005
0 references
0.7705526351928711
0 references
0.7705526351928711
0 references
0.7648425698280334
0 references
0.76371830701828
0 references
