Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract).
Igor RazgonBarry O'SullivanPublished in: ICALP (1) (2008)
Keyphrases
- extended abstract
- fixed parameter tractable
- parameterized complexity
- np complete
- satisfiability problem
- computational problems
- sat problem
- np hard
- global constraints
- bounded treewidth
- sat solvers
- conjunctive queries
- propositional satisfiability
- search algorithm
- phase transition
- max sat
- constraint satisfaction problems
- symmetry breaking
- vertex set
- abstract argumentation
- integer programming
- database systems
- approximation algorithms
- branch and bound algorithm
- decision problems
- special case