Login / Signup

Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width.

Martin Fürer
Published in: LATIN (2012)
Keyphrases
  • tree width
  • np hard
  • search space
  • special case
  • exact and approximate
  • tree decomposition