×
Chen, Hubie; Larose, Benoit

Asking the metaquestions in constraint tractability. (English) Zbl 1427.68115

ACM Trans. Comput. Theory 9, No. 3, Article No. 11, 27 p. (2017).

Cited in 15 Documents

MSC:

68Q25 Analysis of algorithms and problem complexity
08A70 Applications of universal algebra in computer science
68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Keywords:

constraint satisfaction; homomorphisms; metaquestions; polymorphisms; tractability
Cite Review PDF
Full Text: DOI arXiv