A subclass of Horn CNFs optimally compressible in polynomial time (Q693287): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59560576, #quickstatements; #temporary_batch_1710289860281 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10472-010-9197-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1999427653 / rank | |||
Normal rank | |||
Revision as of 12:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A subclass of Horn CNFs optimally compressible in polynomial time |
scientific article |
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
