Complexity versus stability for classes of propositional formulas (Q293437): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973612331 / rank | |||
Normal rank | |||
Latest revision as of 09:07, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity versus stability for classes of propositional formulas |
scientific article |
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
