Complexity versus stability for classes of propositional formulas (Q293437)
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: Complexity versus stability for classes of propositional formulas |
scientific article; zbMATH DE number 6590788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity versus stability for classes of propositional formulas |
scientific article; zbMATH DE number 6590788 |
Statements
Complexity versus stability for classes of propositional formulas (English)
0 references
9 June 2016
0 references
computational complexity
0 references
coNP-completeness
0 references
equivalence of formulas
0 references
Horn formulas
0 references
2CNF formulas
0 references
XOR-CNF formulas
0 references
0.7950155138969421
0 references
0.7841120958328247
0 references
0.7787513732910156
0 references
0.7731776833534241
0 references
