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

  title={The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory},
  author={T. Feder and M. Vardi},
  journal={SIAM J. Comput.},
  • T. Feder, M. Vardi
  • Published 1998
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 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
    Classifying the Complexity of Constraints Using Finite Algebras
    • 540
    • Highly Influenced
    • PDF
    Towards a dichotomy theorem for the counting constraint satisfaction problem
    • 87
    • PDF
    A dichotomy theorem for constraints on a three-element set
    • 194
    • Highly Influenced
    The complexity of homomorphism and constraint satisfaction problems seen from the other side
    • M. Grohe
    • Mathematics, Computer Science
    • 2007
    • 274
    • Highly Influenced
    • PDF
    A dichotomy theorem for constraint satisfaction problems on a 3-element set
    • 323
    A Dichotomy Theorem for Nonuniform CSPs
    • 210
    • PDF
    A Proof of CSP Dichotomy Conjecture
    • D. Zhuk
    • Mathematics, Computer Science
    • 2017
    • 199
    • Highly Influenced
    • PDF
    On the complexity of #CSP
    • 57
    • PDF
    Universal Algebra and Hardness Results for Constraint Satisfaction Problems
    • 79
    • Highly Influenced
    • PDF


    Publications referenced by this paper.
    The complexity of satisfiability problems
    • 1,803
    • Highly Influential
    • PDF
    Optimization, Approximation, and Complexity Classes
    • 1,757
    Easy Problems for Tree-Decomposable Graphs
    • 810
    Generalized first-order spectra, and polynomial. time recognizable sets
    • 638
    • PDF
    On the Structure of Polynomial Time Reducibility
    • 715
    Graph Minors. II. Algorithmic Aspects of Tree-Width
    • 1,465
    Duality and Polynomial Testing of Tree Homomorphisms
    • 112
    • Highly Influential
    • PDF
    The gap between monotone and non-monotone circuit complexity is exponential
    • 153
    • PDF
    The decision problem for the probabilities of higher-order properties
    • 93
    • PDF