Login / Signup

Inapproximability results for set splitting and satisfiability problems with no mixed clauses.

Venkatesan Guruswami
Published in: APPROX (2000)
Keyphrases
  • satisfiability problem
  • temporal logic
  • np complete
  • multi agent systems
  • sat problem
  • conjunctive normal form