On the complexity of equational problems in CNF (Q1404988)
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: On the complexity of equational problems in CNF |
scientific article; zbMATH DE number 1970578
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of equational problems in CNF |
scientific article; zbMATH DE number 1970578 |
Statements
On the complexity of equational problems in CNF (English)
0 references
25 August 2003
0 references
equational reasoning
0 references
complexity
0 references
NP-completeness
0 references
polynomial hierarchy
0 references
0 references
0 references
0.90678596
0 references
0 references
0.89104056
0 references
0.8909188
0 references
0.8866319
0 references
0.8864042
0 references
