The complexity of homomorphisms and renamings for minimal unsatisfiable formulas.

Hans Kleine Büning Daoyun Xu

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

Keyphrases

unsatisfiable cores
propositional formulas
computational complexity
data sets
hidden structure
random sat
worst case
max sat
neural network
relational databases
social networks
computational cost
satisfiability problem
graph theory
space complexity
polynomial hierarchy