Login / Signup

Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms.

Bruno EscoffierVangelis Th. PaschosEmeric Tourniaire
Published in: TAMC (2012)
Keyphrases
  • max sat
  • computational complexity
  • optimization problems
  • orders of magnitude
  • exact algorithms
  • learning algorithm
  • maximum satisfiability
  • model checking
  • utility function