Computation of Renameable Horn Backdoors.

Stephan Kottler Michael Kaufmann Carsten Sinz

Published in: SAT (2008)

Keyphrases

np hard
neural network
search engine
satisfiability problem
hidden structure
databases
social networks
digital libraries
lower bound
efficient computation
sat instances