On the complexity of Boolean unification (Q293360)
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 Boolean unification |
scientific article; zbMATH DE number 6590751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of Boolean unification |
scientific article; zbMATH DE number 6590751 |
Statements
On the complexity of Boolean unification (English)
0 references
9 June 2016
0 references
computational complexity
0 references
automatic theorem proving
0 references
0 references
0.8341866135597229
0 references
0.8163328766822815
0 references
0.808662474155426
0 references
0.7982403039932251
0 references
