Login / Signup

The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs.

Chris CalabroRussell ImpagliazzoValentine KabanetsRamamohan Paturi
Published in: J. Comput. Syst. Sci. (2008)
Keyphrases
  • decision problems
  • search algorithm
  • sat solvers
  • conjunctive normal form
  • genetic algorithm
  • learning algorithm
  • computational cost
  • satisfiability problem
  • space complexity