Hardness results for approximate pure Horn CNF formulae minimization (Q2254607): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:49, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness results for approximate pure Horn CNF formulae minimization |
scientific article |
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
