On the Complexity of MMSNP

@article{Bodirsky2012OnTC,
  title={On the Complexity of MMSNP},
  author={Manuel Bodirsky and Hubie Chen and Tom{\'a}s Feder},
  journal={SIAM J. Discrete Math.},
  year={2012},
  volume={26},
  pages={404-414}
}
Monotone monadic strict NP (MMSNP) is a class of computational problems that is closely related to the class of constraint satisfaction problems for constraint languages over finite domains. It is known that the dichotomy problem for both classes are equivalent. Whereas the dichotomy conjecture has been verified for several subclasses of constraint satisfaction problems, little is known about the the computational complexity for subclasses of MMSNP. In this paper we completely classify the… CONTINUE READING

From This Paper

Topics from this paper.
7 Citations
15 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 15 references

The complexity of satisfiability problems

  • T. J. Schaefer
  • In Proceedings of STOC’78,
  • 1978
Highly Influential
4 Excerpts

Schaefer ’ s theorem for graphs

  • Andrei Bulatov, Andrei Krokhin, G Peter
  • 2011

Jeavons . Classifying the complexity of constraints using finite algebras

  • Nadia Creignou, Sanjeev Khanna
  • SIAM Journal on Computing
  • 2005

Similar Papers

Loading similar papers…