NP-completeness of small conflict set generation for congruence closure (Q1688538)
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: NP-completeness of small conflict set generation for congruence closure |
scientific article; zbMATH DE number 6823094
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness of small conflict set generation for congruence closure |
scientific article; zbMATH DE number 6823094 |
Statements
NP-completeness of small conflict set generation for congruence closure (English)
0 references
8 January 2018
0 references
satisfiability modulo theories
0 references
decision procedures
0 references
congruence closure
0 references
complexity
0 references
0.8502699
0 references
0.8477859
0 references
0 references
0.8275559
0 references
0.82661045
0 references
0.8250474
0 references
0 references
0 references
