Complexity of the problem of being equivalent to Horn formulas (Q2145867)
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: Complexity of the problem of being equivalent to Horn formulas |
scientific article; zbMATH DE number 7541943
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the problem of being equivalent to Horn formulas |
scientific article; zbMATH DE number 7541943 |
Statements
Complexity of the problem of being equivalent to Horn formulas (English)
0 references
15 June 2022
0 references
Horn formula
0 references
\(m\)-reducibility \(\Sigma_1^0\) set
0 references
0 references
0.9477410912513732
0 references
0.7605206370353699
0 references
0.7554160952568054
0 references
0.7366082668304443
0 references
