Login / Signup

The Interface between P and NP in Signed CNF Formulas.

Carlos AnsóteguiRamón BéjarAlba CabiscolFelip Manyà
Published in: ISMVL (2004)
Keyphrases
  • cnf formula
  • np complete
  • computational complexity
  • np hard
  • stable set
  • conjunctive normal form
  • database
  • machine learning
  • information retrieval
  • randomly generated
  • sat problem
  • max sat