Login / Signup
Hardness results for approximate pure Horn CNF formulae minimization.
Endre Boros
Aritanan Gruber
Published in:
Ann. Math. Artif. Intell. (2014)
Keyphrases
</>
horn theories
np hard
knowledge compilation
np complete
canonical representation
functional dependencies
information theoretic
boolean functions
lower bound
computational complexity
objective function
horn clauses
error minimization
exact solution
neural network
image restoration
worst case