Name
Abstract | ||
|---|---|---|
We contribute to a research program that aims to classify, for each finite structure, the computational complexity of the quantified constraint satisfaction problem on the structure. Employing an established algebraic viewpoint to studying this problem family, whereby this classification program can be phrased as a classification of algebras, we give a complete classification of all finite monoids. |
Year | Venue | Field |
|---|---|---|
2016 | CSL | Discrete mathematics,Constraint satisfaction,Combinatorics,Computer science,Constraint graph,Constraint satisfaction problem,Constraint satisfaction dual problem,Monoid,Complexity of constraint satisfaction,Constraint logic programming,Hybrid algorithm (constraint satisfaction) |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hubie Chen | 1 | 418 | 40.82 |
| Peter Mayr | 2 | 5 | 3.34 |