Login / Signup

Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.

Robert GanianPetr HlinenýJan Obdrzálek
Published in: FSTTCS (2010)
Keyphrases
  • satisfiability problem
  • orders of magnitude
  • stochastic local search
  • computational complexity
  • stochastic local search algorithms
  • combinatorial optimization
  • learning algorithm
  • np hard
  • np complete
  • phase transition