A subclass of Horn CNFs optimally compressible in polynomial time.

Endre Boros Ondrej Cepek Alexander Kogan Petr Kucera

Published in: Ann. Math. Artif. Intell. (2009)

Keyphrases

np hard
special case
np complete
approximation algorithms
computational complexity
tractable classes
recursive least squares
compressive sensing
statistical queries
bounded treewidth
complex valued
real valued
horn theories
worst case
constraint satisfaction problems
objective function
propositional logic