Login / Signup

On Problems as Hard as CNF-SAT.

Marek CyganHolger DellDaniel LokshtanovDániel MarxJesper NederlofYoshio OkamotoRamamohan PaturiSaket SaurabhMagnus Wahlström
Published in: ACM Trans. Algorithms (2016)
Keyphrases
  • sat solving
  • np complete
  • sat solvers
  • propositional satisfiability
  • satisfiability problem
  • solving problems
  • sat instances
  • phase transition
  • combinatorial problems
  • search problems
  • practical problems
  • hard problems