Complexity of the problem of being equivalent to Horn formulas. II (Q6160501)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7683806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the problem of being equivalent to Horn formulas. II |
scientific article; zbMATH DE number 7683806 |
Statements
Complexity of the problem of being equivalent to Horn formulas. II (English)
0 references
10 May 2023
0 references
Horn formula
0 references
\(m\)-reducibility
0 references
\({\sum }_1^0\)-set
0 references
0 references
0.9477410912513732
0 references
0.7505040764808655
0 references
0.7462528347969055
0 references
0.7334033846855164
0 references
