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


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… (More)
DOI: 10.1137/S0097539794266766



Citations per Year

975 Citations

Semantic Scholar estimates that this publication has 975 citations based on the available data.

See our FAQ for additional information.