OpenAlex | A subclass of Horn CNFs optimally compressible in polynomial time

A subclass of Horn CNFs optimally compressible in polynomial time

Work

Year: 2009

Type: article

Source: Annals of Mathematics and Artificial Intelligence

Authors Endre Boros, Ondřej Čepek, Alexander Kogan, Petr Kučera

Institutions Rutgers, The State University of New Jersey, Charles University

Cites: 30

Cited by: 22

Related to: 10

FWCI: 1.199

Citation percentile (by year/subfield): 90.49

Topic: Machine Learning and Algorithms

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed