A subclass of Horn CNFs optimally compressible in polynomial time
ČEPEK, Ondřej. A subclass of Horn CNFs optimally compressible in polynomial time. In ECCO XXII. 2009. |
Other formats:
BibTeX
LaTeX
RIS
|
Basic information | |
---|---|
Original name | A subclass of Horn CNFs optimally compressible in polynomial time |
Authors | ČEPEK, Ondřej. |
Edition | ECCO XXII, 2009. |
Other information | |
---|---|
Original language | English |
Type of outcome | Presentations at conferences |
Field of Study | 10201 Computer sciences, information science, bioinformatics |
Country of publisher | Israel |
Confidentiality degree | is not subject to a state or trade secret |
Changed by | Changed by: RNDr. Patrik Mottl, Ph.D., učo 19375. Changed: 8/12/2009 15:36. |
PrintDisplayed: 26/8/2024 22:40