The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

@article{Feder1998TheCS,
  title={The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory},
  author={Tom{\'a}s Feder and Moshe Y. Vardi},
  journal={SIAM J. Comput.},
  year={1998},
  volume={28},
  pages={57-104}
}
This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this subclass via syntactic prescriptions. While the paper does not achieve this goal, it does isolate a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit this dichotomy. We justify the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 645 CITATIONS, ESTIMATED 93% COVERAGE

Complexity Classification in Infinite-Domain Constraint Satisfaction

VIEW 15 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The complexity of signed graph and 2-edge-coloured graph homomorphisms

VIEW 12 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The complexity of tropical graph homomorphisms

  • Discrete Applied Mathematics
  • 2017
VIEW 10 EXCERPTS
CITES RESULTS & BACKGROUND
HIGHLY INFLUENCED

Weak consistency notions for all the CSPs of bounded width∗

  • 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2016
VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Graph Homomorphisms and Universal Algebra Course Notes

Manuel Bodirsky, Manuel. Bodirsky
  • 2015
VIEW 10 EXCERPTS
HIGHLY INFLUENCED

Hybrid (V)CSPs and algebraic reductions

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

MALTSEV ON TOP MIKLÓS MARÓTI Abstract

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

On the Containment of Forbidden Patterns Problems

VIEW 12 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1999
2019

CITATION STATISTICS

  • 183 Highly Influenced Citations

  • Averaged 37 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-10 OF 45 REFERENCES

Near subgroups of finite groups

VIEW 13 EXCERPTS
HIGHLY INFLUENTIAL

On the complexity of H-coloring

  • J. Comb. Theory, Ser. B
  • 1990
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

The complexity of satisfiability problems

T. J. Schaefer
  • Proc. 10th ACM Symp. on Theory of Computing (1978), 216–226.
  • 1978
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Homomorphism problems on graphs with some self-loops

T. Feder, P. Hell
  • manuscript.
VIEW 17 EXCERPTS
HIGHLY INFLUENTIAL

List problems for reflexive graphs

T. Feder, P. Hell
  • manuscript.
VIEW 17 EXCERPTS
HIGHLY INFLUENTIAL

The Existence of Homomorphisms to Oriented Cycles

  • SIAM J. Discrete Math.
  • 1995
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Homomorphisms to oriented paths

  • Discrete Mathematics
  • 1994
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL