J
2010
A subclass of Horn CNFs optimally compressible in polynomial time
BOROS, E.; Ondřej ČEPEK; A. KOGAN and P. KUČERA
Basic information
Original name
A subclass of Horn CNFs optimally compressible in polynomial time
Authors
BOROS, E.; Ondřej ČEPEK; A. KOGAN and P. KUČERA
Edition
Annals of Mathematics and Artificial Intelligence, 2010, 1012-2443
Other information
Type of outcome
Article in a journal
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Czech Republic
Confidentiality degree
is not subject to a state or trade secret
Impact factor
Impact factor: 0.430
Organization unit
University of Finance and Administration
Displayed: 17/7/2025 10:49