Testing satisfiability of CNF formulas by computing a stable set of points (Q1777393)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2168184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Testing satisfiability of CNF formulas by computing a stable set of points |
scientific article; zbMATH DE number 2168184 |
Statements
Testing satisfiability of CNF formulas by computing a stable set of points (English)
0 references
13 May 2005
0 references
conjunctive normal form
0 references
0.7508443593978882
0 references
0.7481437921524048
0 references
0.7429124712944031
0 references
0.7419933676719666
0 references
