Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). II (Q852241)
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 5076478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). II |
scientific article; zbMATH DE number 5076478 |
Statements
Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). II (English)
0 references
28 November 2006
0 references
data representation
0 references
estimation of complexity
0 references
0.8923954963684082
0 references
0.7657696008682251
0 references
0.7591268420219421
0 references
