On the complexity of Boolean unification (Q293360): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68T15 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6590751 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
automatic theorem proving | |||
| Property / zbMATH Keywords: automatic theorem proving / rank | |||
Normal rank | |||
Revision as of 21:17, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of Boolean unification |
scientific article |
Statements
On the complexity of Boolean unification (English)
0 references
9 June 2016
0 references
computational complexity
0 references
automatic theorem proving
0 references
