A subclass of Horn CNFs optimally compressible in polynomial time (Q693287)
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: A subclass of Horn CNFs optimally compressible in polynomial time |
scientific article; zbMATH DE number 6114097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A subclass of Horn CNFs optimally compressible in polynomial time |
scientific article; zbMATH DE number 6114097 |
Statements
A subclass of Horn CNFs optimally compressible in polynomial time (English)
0 references
7 December 2012
0 references
propositional Horn expert systems
0 references
Horn functions
0 references
Horn minimization
0 references
Boolean minimization
0 references
CQ functions
0 references
essential sets
0 references
exclusive sets
0 references
polynomial-time HM algorithm
0 references
0 references
0 references
0.9015069603919984
0 references
0.8675264716148376
0 references
0.8675264716148376
0 references
0.8046222925186157
0 references
0.7936094403266907
0 references
