Hardness results for approximate pure Horn CNF formulae minimization (Q2254607)
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 6398473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness results for approximate pure Horn CNF formulae minimization |
scientific article; zbMATH DE number 6398473 |
Statements
Hardness results for approximate pure Horn CNF formulae minimization (English)
0 references
5 February 2015
0 references
Boolean functions
0 references
propositional Horn logic
0 references
hardness of approximation
0 references
computational complexity
0 references
artificial intelligence
0 references
0 references
0 references
0.92347586
0 references
0 references
0.8765934
0 references
0.8726711
0 references
0.8652166
0 references
0.8640502
0 references
0.8636614
0 references
