Zhuk, Dmitriy Constraint satisfaction problem: what makes the problem easy. (English) Zbl 07823032 Beliaev, Dmitry (ed.) et al., International congress of mathematicians 2022, ICM 2022, Helsinki, Finland, virtual, July 6–14, 2022. Volume 3. Sections 1–4. Berlin: European Mathematical Society (EMS). 1530-1552 (2023). MSC: 03B70 08A70 68Q17 03D15 68T27 03B10 PDFBibTeX XMLCite \textit{D. Zhuk}, in: International congress of mathematicians 2022, ICM 2022, Helsinki, Finland, virtual, July 6--14, 2022. Volume 3. Sections 1--4. Berlin: European Mathematical Society (EMS). 1530--1552 (2023; Zbl 07823032) Full Text: DOI OA License
Takhanov, Rustem Computing a partition function of a generalized pattern-based energy over a semiring. (English) Zbl 07729117 Theory Comput. Syst. 67, No. 4, 760-784 (2023). MSC: 68Qxx 68Txx 08Axx PDFBibTeX XMLCite \textit{R. Takhanov}, Theory Comput. Syst. 67, No. 4, 760--784 (2023; Zbl 07729117) Full Text: DOI arXiv
Schneider, Friedrich Martin; Viola, Caterina An application of Farkas’ lemma to finite-valued constraint satisfaction problems over infinite domains. (English) Zbl 07590528 J. Math. Anal. Appl. 517, No. 1, Article ID 126591, 22 p. (2023). MSC: 68Qxx 90Cxx 08Axx PDFBibTeX XMLCite \textit{F. M. Schneider} and \textit{C. Viola}, J. Math. Anal. Appl. 517, No. 1, Article ID 126591, 22 p. (2023; Zbl 07590528) Full Text: DOI arXiv
Lagerkvist, Victor; Wahlström, Magnus The (coarse) fine-grained structure of NP-hard SAT and CSP problems. (English) Zbl 1495.68158 ACM Trans. Comput. Theory 14, No. 1, Paper No. 2, 54 p. (2022). MSC: 68R07 08A70 68Q17 PDFBibTeX XMLCite \textit{V. Lagerkvist} and \textit{M. Wahlström}, ACM Trans. Comput. Theory 14, No. 1, Paper No. 2, 54 p. (2022; Zbl 1495.68158) Full Text: DOI
Brakensiek, Joshua; Gopi, Sivakanth; Guruswami, Venkatesan Constraint satisfaction problems with global modular constraints: algorithms and hardness via polynomial representations. (English) Zbl 07538272 SIAM J. Comput. 51, No. 3, 577-626 (2022). MSC: 68Q25 94B05 20K01 68W20 08A70 03B70 12Y05 PDFBibTeX XMLCite \textit{J. Brakensiek} et al., SIAM J. Comput. 51, No. 3, 577--626 (2022; Zbl 07538272) Full Text: DOI
Couceiro, Miguel; Haddad, Lucien; Lagerkvist, Victor A survey on the fine-grained complexity of constraint satisfaction problems based on partial polymorphisms. (English) Zbl 07536562 J. Mult.-Val. Log. Soft Comput. 38, No. 1-2, 115-136 (2022). MSC: 08A70 08A40 08A55 68Q25 PDFBibTeX XMLCite \textit{M. Couceiro} et al., J. Mult.-Val. Log. Soft Comput. 38, No. 1--2, 115--136 (2022; Zbl 07536562) Full Text: Link
Gillibert, Pierre; Jonušas, Julius; Kompatscher, Michael; Mottet, Antoine; Pinsker, Michael When symmetries are not enough: a hierarchy of hard constraint satisfaction problems. (English) Zbl 1483.68141 SIAM J. Comput. 51, No. 2, 175-213 (2022). MSC: 68Q15 03C05 03C35 08A40 08A70 68R07 PDFBibTeX XMLCite \textit{P. Gillibert} et al., SIAM J. Comput. 51, No. 2, 175--213 (2022; Zbl 1483.68141) Full Text: DOI arXiv
Barto, Libor; Bulín, Jakub; Krokhin, Andrei; Opršal, Jakub Algebraic approach to promise constraint satisfaction. (English) Zbl 1499.68140 J. ACM 68, No. 4, Paper No. 28, 66 p. (2021). MSC: 68Q25 05C15 08A70 68Q17 PDFBibTeX XMLCite \textit{L. Barto} et al., J. ACM 68, No. 4, Paper No. 28, 66 p. (2021; Zbl 1499.68140) Full Text: DOI
Brakensiek, Joshua; Guruswami, Venkatesan Promise constraint satisfaction: algebraic structure and a symmetric Boolean dichotomy. (English) Zbl 1494.68094 SIAM J. Comput. 50, No. 6, 1663-1700 (2021). MSC: 68Q25 08A70 68R07 68W25 PDFBibTeX XMLCite \textit{J. Brakensiek} and \textit{V. Guruswami}, SIAM J. Comput. 50, No. 6, 1663--1700 (2021; Zbl 1494.68094) Full Text: DOI arXiv
Zhuk, Dmitriy Strong subalgebras and the constraint satisfaction problem. (English) Zbl 07536113 J. Mult.-Val. Log. Soft Comput. 36, No. 4-5, 455-504 (2021). MSC: 08A70 08A30 68Q25 PDFBibTeX XMLCite \textit{D. Zhuk}, J. Mult.-Val. Log. Soft Comput. 36, No. 4--5, 455--504 (2021; Zbl 07536113) Full Text: arXiv Link
Brandts, Alex; Wrochna, Marcin; Živný, Stanislav The complexity of promise SAT on non-Boolean domains. (English) Zbl 1495.68157 ACM Trans. Comput. Theory 13, No. 4, Article No. 26, 20 p. (2021). MSC: 68R07 08A70 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Brandts} et al., ACM Trans. Comput. Theory 13, No. 4, Article No. 26, 20 p. (2021; Zbl 1495.68157) Full Text: DOI arXiv
Jonsson, Peter; Lagerkvist, Victor; Roy, Biman Fine-grained time complexity of constraint satisfaction problems. (English) Zbl 1495.68101 ACM Trans. Comput. Theory 13, No. 1, Article No. 2, 32 p. (2021). MSC: 68Q25 08A70 68Q15 68Q17 68Q27 68T20 PDFBibTeX XMLCite \textit{P. Jonsson} et al., ACM Trans. Comput. Theory 13, No. 1, Article No. 2, 32 p. (2021; Zbl 1495.68101) Full Text: DOI Link
Jonsson, Peter; Lagerkvist, Victor; Schmidt, Johannes; Uppman, Hannes The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. (English) Zbl 1514.68085 Theor. Comput. Sci. 892, 1-24 (2021). MSC: 68Q25 08A70 68Q17 PDFBibTeX XMLCite \textit{P. Jonsson} et al., Theor. Comput. Sci. 892, 1--24 (2021; Zbl 1514.68085) Full Text: DOI
Bodirsky, Manuel; Pinsker, Michael; Pongrácz, András Projective clone homomorphisms. (English) Zbl 07370805 J. Symb. Log. 86, No. 1, 148-161 (2021). MSC: 03C05 03C35 03C40 08A70 08A35 08A30 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., J. Symb. Log. 86, No. 1, 148--161 (2021; Zbl 07370805) Full Text: DOI arXiv Link
Deng, Guofeng; Sai, Ezzeddine El; Manders, Trevor; Mayr, Peter; Nakkirt, Poramate; Sparks, Athena Sandwiches for promise constraint satisfaction. (English) Zbl 1509.68100 Algebra Univers. 82, No. 1, Paper No. 15, 9 p. (2021). MSC: 68Q25 08A70 68R07 68Q17 PDFBibTeX XMLCite \textit{G. Deng} et al., Algebra Univers. 82, No. 1, Paper No. 15, 9 p. (2021; Zbl 1509.68100) Full Text: DOI arXiv
Briceño, Raimundo; Bulatov, Andrei; Dalmau, Víctor; Larose, Benoît Dismantlability, connectedness, and mixing in relational structures. (English) Zbl 1503.08002 J. Comb. Theory, Ser. B 147, 37-70 (2021). MSC: 08A70 05C90 60C05 68Q87 82B20 PDFBibTeX XMLCite \textit{R. Briceño} et al., J. Comb. Theory, Ser. B 147, 37--70 (2021; Zbl 1503.08002) Full Text: DOI arXiv Link
Lagerkvist, Victor; Roy, Biman Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem. (English) Zbl 1477.68127 J. Comput. Syst. Sci. 117, 23-39 (2021). MSC: 68Q25 08A70 68R07 PDFBibTeX XMLCite \textit{V. Lagerkvist} and \textit{B. Roy}, J. Comput. Syst. Sci. 117, 23--39 (2021; Zbl 1477.68127) Full Text: DOI
Bodirsky, Manuel; Mottet, Antoine; Olšák, Miroslav; Opršal, Jakub; Pinsker, Michael; Willard, Ross \( \omega \)-categorical structures avoiding height 1 identities. (English) Zbl 1472.08006 Trans. Am. Math. Soc. 374, No. 1, 327-350 (2021). Reviewer: Keith Kearnes (Boulder) MSC: 08B05 03C05 08A70 03C10 03D15 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Trans. Am. Math. Soc. 374, No. 1, 327--350 (2021; Zbl 1472.08006) Full Text: DOI arXiv
Lagerkvist, Victor; Wahlström, Magnus Sparsification of SAT and CSP problems via tractable extensions. (English) Zbl 1499.68241 ACM Trans. Comput. Theory 12, No. 2, Article No. 13, 29 p. (2020). MSC: 68R07 08A70 68Q27 PDFBibTeX XMLCite \textit{V. Lagerkvist} and \textit{M. Wahlström}, ACM Trans. Comput. Theory 12, No. 2, Article No. 13, 29 p. (2020; Zbl 1499.68241) Full Text: DOI
Bulatov, Andrei A.; Živný, Stanislav Approximate counting CSP seen from the other side. (English) Zbl 1499.68239 ACM Trans. Comput. Theory 12, No. 2, Article No. 11, 19 p. (2020). MSC: 68R07 08A70 68Q25 68Q27 PDFBibTeX XMLCite \textit{A. A. Bulatov} and \textit{S. Živný}, ACM Trans. Comput. Theory 12, No. 2, Article No. 11, 19 p. (2020; Zbl 1499.68239) Full Text: DOI
Wrona, Michał On the relational width of first-order expansions of finitely bounded homogeneous binary cores with bounded strict width. (English) Zbl 1498.03071 Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 958-971 (2020). MSC: 03C13 03C05 08A70 68Q17 PDFBibTeX XMLCite \textit{M. Wrona}, in: Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8--11, 2020. New York, NY: Association for Computing Machinery (ACM). 958--971 (2020; Zbl 1498.03071) Full Text: DOI arXiv
Bodirsky, Manuel; Pakusa, Wied; Rydval, Jakub Temporal constraint satisfaction problems in fixed-point logic. (English) Zbl 1498.08003 Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 237-251 (2020). MSC: 08A70 03B70 08A40 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., in: Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8--11, 2020. New York, NY: Association for Computing Machinery (ACM). 237--251 (2020; Zbl 1498.08003) Full Text: DOI arXiv
Zhuk, Dmitriy A proof of the CSP dichotomy conjecture. (English) Zbl 1491.68128 J. ACM 67, No. 5, Article No. 30, 78 p. (2020). MSC: 68R07 08A40 08A70 68Q25 68W40 PDFBibTeX XMLCite \textit{D. Zhuk}, J. ACM 67, No. 5, Article No. 30, 78 p. (2020; Zbl 1491.68128) Full Text: DOI arXiv
Bodirsky, Manuel; Vucaj, Albert Two-element structures modulo primitive positive constructability. (English) Zbl 1477.08003 Algebra Univers. 81, No. 2, Paper No. 20, 17 p. (2020). MSC: 08A40 08A70 08B05 68Q17 PDFBibTeX XMLCite \textit{M. Bodirsky} and \textit{A. Vucaj}, Algebra Univers. 81, No. 2, Paper No. 20, 17 p. (2020; Zbl 1477.08003) Full Text: DOI arXiv
Barto, Libor; Pinsker, Michael Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems). (English) Zbl 1432.68169 SIAM J. Comput. 49, No. 2, 365-393 (2020). MSC: 68Q25 03C05 03C35 08A70 68Q17 68Q27 68R07 PDFBibTeX XMLCite \textit{L. Barto} and \textit{M. Pinsker}, SIAM J. Comput. 49, No. 2, 365--393 (2020; Zbl 1432.68169) Full Text: DOI arXiv
Dellunde, Pilar; Vidal, Amanda Truth-preservation under fuzzy pp-formulas. (English) Zbl 1503.68077 Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 27, Suppl. 1, 89-105 (2019). MSC: 68Q25 03B52 03B70 08A70 PDFBibTeX XMLCite \textit{P. Dellunde} and \textit{A. Vidal}, Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 27, 89--105 (2019; Zbl 1503.68077) Full Text: DOI arXiv
Bulatov, Andrei A.; Živný, Stanislav Approximate counting CSP seen from the other side. (English) Zbl 1499.68238 Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 60, 14 p. (2019). MSC: 68R07 08A70 68Q25 68Q27 PDFBibTeX XMLCite \textit{A. A. Bulatov} and \textit{S. Živný}, LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 60, 14 p. (2019; Zbl 1499.68238) Full Text: DOI arXiv
Briceño, Raimundo; Bulatov, Andrei A.; Dalmau, Víctor; Larose, Benoît Dismantlability, connectedness, and mixing in relational structures. (English) Zbl 1503.08001 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 29, 15 p. (2019). MSC: 08A70 05C90 60C05 68Q87 82B20 PDFBibTeX XMLCite \textit{R. Briceño} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 29, 15 p. (2019; Zbl 1503.08001) Full Text: DOI
Larose, Benoît; Martin, Barnaby; Paulusma, Daniël Surjective H-colouring over reflexive digraphs. (English) Zbl 1485.68190 ACM Trans. Comput. Theory 11, No. 1, Article No. 3, 21 p. (2019). MSC: 68R10 05C20 05C60 08A70 68Q17 68Q25 PDFBibTeX XMLCite \textit{B. Larose} et al., ACM Trans. Comput. Theory 11, No. 1, Article No. 3, 21 p. (2019; Zbl 1485.68190) Full Text: DOI arXiv Link
Barto, Libor; Kompatscher, Michael; Olšák, Miroslav; Pham, Trung Van; Pinsker, Michael Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures. (English) Zbl 1477.03118 J. Math. Log. 19, No. 2, Article ID 1950010, 31 p. (2019). MSC: 03C05 08A40 03C35 03C40 08B05 68Q17 20B27 PDFBibTeX XMLCite \textit{L. Barto} et al., J. Math. Log. 19, No. 2, Article ID 1950010, 31 p. (2019; Zbl 1477.03118) Full Text: DOI arXiv
Bulatov, Andrei A. Constraint satisfaction problems over semilattice block Mal’tsev algebras. (English) Zbl 1434.68191 Inf. Comput. 268, Article ID 104437, 14 p. (2019). MSC: 68Q25 08B05 68R07 PDFBibTeX XMLCite \textit{A. A. Bulatov}, Inf. Comput. 268, Article ID 104437, 14 p. (2019; Zbl 1434.68191) Full Text: DOI arXiv
Bodirsky, Manuel; Martin, Barnaby; Pinsker, Michael; Pongrácz, András Constraint satisfaction problems for reducts of homogeneous graphs. (English) Zbl 1430.68121 SIAM J. Comput. 48, No. 4, 1224-1264 (2019). MSC: 68Q25 03C15 05C55 05C75 08A70 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., SIAM J. Comput. 48, No. 4, 1224--1264 (2019; Zbl 1430.68121) Full Text: DOI
Chen, Hubie; Valeriote, Matt; Yoshida, Yuichi Constant-query testability of assignments to constraint satisfaction problems. (English) Zbl 1430.68439 SIAM J. Comput. 48, No. 3, 1022-1045 (2019). MSC: 68W20 08A02 08A70 68R07 PDFBibTeX XMLCite \textit{H. Chen} et al., SIAM J. Comput. 48, No. 3, 1022--1045 (2019; Zbl 1430.68439) Full Text: DOI
Zhuk, Dmitriy The size of generating sets of powers. (English) Zbl 1492.68098 J. Comb. Theory, Ser. A 167, 91-103 (2019). MSC: 68R07 08A30 08A70 PDFBibTeX XMLCite \textit{D. Zhuk}, J. Comb. Theory, Ser. A 167, 91--103 (2019; Zbl 1492.68098) Full Text: DOI arXiv
Kompatscher, Michael; Trung Van Pham A complexity dichotomy for poset constraint satisfaction. (English) Zbl 1513.08002 J. Appl. Log. - IfCoLog J. Log. Appl. 5, No. 8, 1663-1697 (2018). MSC: 08A40 03C15 03C35 03C50 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Kompatscher} and \textit{Trung Van Pham}, J. Appl. Log. - IfCoLog J. Log. Appl. 5, No. 8, 1663--1697 (2018; Zbl 1513.08002)
Idziak, Pawel M.; Kawalek, Piotr; Krzaczkowski, Jacek Expressive power, satisfiability and equivalence of circuits over nilpotent algebras. (English) Zbl 1510.68075 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 17, 15 p. (2018). MSC: 68R07 08A70 68Q06 68Q25 PDFBibTeX XMLCite \textit{P. M. Idziak} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 17, 15 p. (2018; Zbl 1510.68075) Full Text: DOI
Madelaine, Florent R.; Martin, Barnaby Consistency for counting quantifiers. (English) Zbl 1510.68031 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 11, 13 p. (2018). MSC: 68Q25 03B70 08A70 PDFBibTeX XMLCite \textit{F. R. Madelaine} and \textit{B. Martin}, LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 11, 13 p. (2018; Zbl 1510.68031) Full Text: DOI
Larose, Benoît; Martin, Barnaby; Paulusma, Daniël Surjective H-colouring over reflexive digraphs. (English) Zbl 1485.68191 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 49, 14 p. (2018). MSC: 68R10 05C20 05C60 08A70 68Q17 68Q25 PDFBibTeX XMLCite \textit{B. Larose} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 49, 14 p. (2018; Zbl 1485.68191) Full Text: DOI
Draganić, Nemanja; Marković, Petar; Uljarević, Vlado; Zahirović, Samir A characterization of idempotent strong Mal’cev conditions for congruence meet-semidistributivity in locally finite varieties. (English) Zbl 1454.08005 Algebra Univers. 79, No. 3, Paper No. 53, 34 p. (2018). MSC: 08B05 08B10 08A70 05D10 PDFBibTeX XMLCite \textit{N. Draganić} et al., Algebra Univers. 79, No. 3, Paper No. 53, 34 p. (2018; Zbl 1454.08005) Full Text: DOI
Dalmau, Víctor; Krokhin, Andrei; Manokaran, Rajsekar Towards a characterization of constant-factor approximable finite-valued CSPs. (English) Zbl 1398.68666 J. Comput. Syst. Sci. 97, 14-27 (2018). MSC: 68W25 08A70 68Q17 PDFBibTeX XMLCite \textit{V. Dalmau} et al., J. Comput. Syst. Sci. 97, 14--27 (2018; Zbl 1398.68666) Full Text: DOI arXiv Link
Ham, Lucy; Jackson, Marcel Axiomatisability and hardness for universal Horn classes of hypergraphs. (English) Zbl 1522.08003 Algebra Univers. 79, No. 2, Paper No. 30, 17 p. (2018). MSC: 08C15 05C65 05C60 68Q17 03C13 PDFBibTeX XMLCite \textit{L. Ham} and \textit{M. Jackson}, Algebra Univers. 79, No. 2, Paper No. 30, 17 p. (2018; Zbl 1522.08003) Full Text: DOI arXiv
Martin, Barnaby Quantified constraints in twenty seventeen. (English) Zbl 1482.68168 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 327-346 (2017). MSC: 68R07 08A70 68Q25 68Q27 PDFBibTeX XMLCite \textit{B. Martin}, Dagstuhl Follow-Ups 7, 327--346 (2017; Zbl 1482.68168) Full Text: DOI
Larose, Benoit Algebra and the complexity of digraph CSPs: a survey. (English) Zbl 1482.68166 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 267-285 (2017). MSC: 68R07 05C20 08A70 68Q25 68R10 PDFBibTeX XMLCite \textit{B. Larose}, Dagstuhl Follow-Ups 7, 267--285 (2017; Zbl 1482.68166) Full Text: DOI
Gaspers, Serge; Ordyniak, Sebastian; Szeider, Stefan Backdoor sets for CSP. (English) Zbl 1482.68163 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 137-157 (2017). MSC: 68R07 08A70 68Q25 68Q27 PDFBibTeX XMLCite \textit{S. Gaspers} et al., Dagstuhl Follow-Ups 7, 137--157 (2017; Zbl 1482.68163) Full Text: DOI
Bodirsky, Manuel; Mamino, Marcello Constraint satisfaction problems over numeric domains. (English) Zbl 1482.68162 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 79-111 (2017). MSC: 68R07 08A70 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Bodirsky} and \textit{M. Mamino}, Dagstuhl Follow-Ups 7, 79--111 (2017; Zbl 1482.68162) Full Text: DOI
Barto, Libor; Kozik, Marcin Absorption in universal algebra and CSP. (English) Zbl 1482.68160 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 45-77 (2017). MSC: 68R07 08A70 68Q25 PDFBibTeX XMLCite \textit{L. Barto} and \textit{M. Kozik}, Dagstuhl Follow-Ups 7, 45--77 (2017; Zbl 1482.68160) Full Text: DOI
Barto, Libor; Krokhin, Andrei; Willard, Ross Polymorphisms, and how to use them. (English) Zbl 1482.68161 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 1-44 (2017). MSC: 68R07 08A70 68Q25 PDFBibTeX XMLCite \textit{L. Barto} et al., Dagstuhl Follow-Ups 7, 1--44 (2017; Zbl 1482.68161) Full Text: DOI
Takhanov, Rustem Hybrid VCSPs with crisp and valued conservative templates. (English) Zbl 1457.68130 Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 65, 13 p. (2017). MSC: 68Q25 08A02 08A70 68R07 PDFBibTeX XMLCite \textit{R. Takhanov}, LIPIcs -- Leibniz Int. Proc. Inform. 92, Article 65, 13 p. (2017; Zbl 1457.68130) Full Text: DOI
Carvalho, Catarina; Martin, Barnaby; Zhuk, Dmitriy The complexity of quantified constraints using the algebraic formulation. (English) Zbl 1441.68087 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 27, 14 p. (2017). MSC: 68Q25 08A70 68R07 PDFBibTeX XMLCite \textit{C. Carvalho} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 27, 14 p. (2017; Zbl 1441.68087) Full Text: DOI arXiv
Jonsson, Peter; Lagerkvist, Victor; Roy, Biman Time complexity of constraint satisfaction via universal algebra. (English) Zbl 1441.68093 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 17, 15 p. (2017). MSC: 68Q25 08A40 08A70 68Q17 68Q27 68R07 PDFBibTeX XMLCite \textit{P. Jonsson} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 17, 15 p. (2017; Zbl 1441.68093) Full Text: DOI arXiv
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). MSC: 68Q25 08A70 68Q17 PDFBibTeX XMLCite \textit{H. Chen} and \textit{B. Larose}, ACM Trans. Comput. Theory 9, No. 3, Article No. 11, 27 p. (2017; Zbl 1427.68115) Full Text: DOI arXiv
Romov, Boris A. Extendable partial clones on a finite set. (English) Zbl 1398.08005 J. Mult.-Val. Log. Soft Comput. 28, No. 1, 81-104 (2017). MSC: 08A40 08A55 PDFBibTeX XMLCite \textit{B. A. Romov}, J. Mult.-Val. Log. Soft Comput. 28, No. 1, 81--104 (2017; Zbl 1398.08005) Full Text: Link
Kompatscher, Michael; Pham, Trung Van A complexity dichotomy for poset constraint satisfaction. (English) Zbl 1402.68099 Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 47, 12 p. (2017). MSC: 68Q25 03C35 05D10 08A40 08A70 68Q17 PDFBibTeX XMLCite \textit{M. Kompatscher} and \textit{T. Van Pham}, LIPIcs -- Leibniz Int. Proc. Inform. 66, Article 47, 12 p. (2017; Zbl 1402.68099) Full Text: DOI arXiv
Lagerkvist, Victor; Wahlström, Magnus The power of primitive positive definitions with polynomially many variables. (English) Zbl 1387.08001 J. Log. Comput. 27, No. 5, 1465-1488 (2017). Reviewer: Lavinia Ciungu (Iowa City) MSC: 08A40 08A70 PDFBibTeX XMLCite \textit{V. Lagerkvist} and \textit{M. Wahlström}, J. Log. Comput. 27, No. 5, 1465--1488 (2017; Zbl 1387.08001) Full Text: DOI Link
Ham, Lucy Relativised homomorphism preservation at the finite level. (English) Zbl 1417.03227 Stud. Log. 105, No. 4, 761-786 (2017). MSC: 03C13 03C05 03C40 06B05 08C15 PDFBibTeX XMLCite \textit{L. Ham}, Stud. Log. 105, No. 4, 761--786 (2017; Zbl 1417.03227) Full Text: DOI arXiv
Cohen, David A.; Cooper, Martin C.; Jeavons, Peter G.; Krokhin, Andrei; Powell, Robert; Živný, Stanislav Binarisation for valued constraint satisfaction problems. (English) Zbl 1477.68121 SIAM J. Discrete Math. 31, No. 4, 2279-2300 (2017). MSC: 68Q25 08A70 68Q17 PDFBibTeX XMLCite \textit{D. A. Cohen} et al., SIAM J. Discrete Math. 31, No. 4, 2279--2300 (2017; Zbl 1477.68121) Full Text: DOI arXiv
Thapper, Johan; Živný, Stanislav The power of Sherali-Adams relaxations for general-valued CSPs. (English) Zbl 1371.68125 SIAM J. Comput. 46, No. 4, 1241-1279 (2017). MSC: 68Q25 08A70 68Q17 PDFBibTeX XMLCite \textit{J. Thapper} and \textit{S. Živný}, SIAM J. Comput. 46, No. 4, 1241--1279 (2017; Zbl 1371.68125) Full Text: DOI arXiv
Bulatov, Andrei; Goldberg, Leslie Ann; Jerrum, Mark; Richerby, David; Živný, Stanislav Functional clones and expressibility of partition functions. (English) Zbl 1418.08001 Theor. Comput. Sci. 687, 11-39 (2017). MSC: 08A40 08A70 PDFBibTeX XMLCite \textit{A. Bulatov} et al., Theor. Comput. Sci. 687, 11--39 (2017; Zbl 1418.08001) Full Text: DOI arXiv
Ham, Lucy Gap theorems for robust satisfiability: Boolean CSPs and beyond. (English) Zbl 1370.68128 Theor. Comput. Sci. 676, 69-91 (2017). MSC: 68Q25 08A40 68Q17 PDFBibTeX XMLCite \textit{L. Ham}, Theor. Comput. Sci. 676, 69--91 (2017; Zbl 1370.68128) Full Text: DOI arXiv
Rorabaugh, Danny; Tardif, Claude; Wehlau, David Logical compactness and constraint satisfaction problems. (English) Zbl 1448.03020 Log. Methods Comput. Sci. 13, No. 1, Paper No. 1, 11 p. (2017). MSC: 03C07 03C50 03E05 03E65 08A02 08A70 68Q19 68T20 PDFBibTeX XMLCite \textit{D. Rorabaugh} et al., Log. Methods Comput. Sci. 13, No. 1, Paper No. 1, 11 p. (2017; Zbl 1448.03020) Full Text: DOI arXiv
Fulla, Peter; Živný, Stanislav A Galois connection for weighted (relational) clones of infinite size. (English) Zbl 1427.68120 ACM Trans. Comput. Theory 8, No. 3, Article No. 9, 21 p. (2016). MSC: 68Q25 06A15 08A40 08A70 PDFBibTeX XMLCite \textit{P. Fulla} and \textit{S. Živný}, ACM Trans. Comput. Theory 8, No. 3, Article No. 9, 21 p. (2016; Zbl 1427.68120) Full Text: DOI arXiv Link
Barto, Libor; Pinsker, Michael The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems. (English) Zbl 1401.68108 Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 615-622 (2016). MSC: 68Q25 03C13 08A40 08A70 68Q17 PDFBibTeX XMLCite \textit{L. Barto} and \textit{M. Pinsker}, in: Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5--8, 2016. New York, NY: Association for Computing Machinery (ACM). 615--622 (2016; Zbl 1401.68108) Full Text: DOI arXiv
Bodirsky, Manuel; Martin, Barnaby; Pinsker, Michael; Pongrácz, András Constraint satisfaction problems for reducts of homogeneous graphs. (English) Zbl 1388.68102 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 119, 14 p. (2016). MSC: 68Q25 03C15 05C75 08A70 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 119, 14 p. (2016; Zbl 1388.68102) Full Text: DOI arXiv
Chen, Hubie; Mayr, Peter Quantified constraint satisfaction on monoids. (English) Zbl 1369.68219 Regnier, Laurent (ed.) et al., 25th EACSL annual conference and 30th workshop on computer science logic, CSL’16, Marseille, France, August 29 – September 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-022-4). LIPIcs – Leibniz International Proceedings in Informatics 62, Article 15, 14 p. (2016). MSC: 68Q19 03C13 08A70 20M35 68Q17 PDFBibTeX XMLCite \textit{H. Chen} and \textit{P. Mayr}, LIPIcs -- Leibniz Int. Proc. Inform. 62, Article 15, 14~p. (2016; Zbl 1369.68219) Full Text: DOI
Jackson, Marcel; Kowalski, Tomasz; Niven, Todd Complexity and polymorphisms for digraph constraint problems under some basic constructions. (English) Zbl 1401.05132 Int. J. Algebra Comput. 26, No. 7, 1395-1433 (2016). MSC: 05C20 08A70 08A40 08A35 68Q25 PDFBibTeX XMLCite \textit{M. Jackson} et al., Int. J. Algebra Comput. 26, No. 7, 1395--1433 (2016; Zbl 1401.05132) Full Text: DOI arXiv
Yoshida, Yuichi Testing list \(H\)-homomorphisms. (English) Zbl 1353.68139 Comput. Complexity 25, No. 4, 737-773 (2016). MSC: 68Q25 05C60 08A70 68W20 PDFBibTeX XMLCite \textit{Y. Yoshida}, Comput. Complexity 25, No. 4, 737--773 (2016; Zbl 1353.68139) Full Text: DOI
Jovanović, Jelena; Marković, Petar; McKenzie, Ralph; Moore, Matthew Optimal strong Mal’cev conditions for congruence meet-semidistributivity in locally finite varieties. (English) Zbl 1355.08003 Algebra Univers. 76, No. 3, 305-325 (2016). Reviewer: Ivan Chajda (Přerov) MSC: 08B05 08B10 PDFBibTeX XMLCite \textit{J. Jovanović} et al., Algebra Univers. 76, No. 3, 305--325 (2016; Zbl 1355.08003) Full Text: DOI
Kazda, Alexandr CSP for binary conservative relational structures. (English) Zbl 1356.08001 Algebra Univers. 75, No. 1, 75-84 (2016). Reviewer: Jakub Bulín (Boulder) MSC: 08A02 03C05 08A30 68R05 68T20 PDFBibTeX XMLCite \textit{A. Kazda}, Algebra Univers. 75, No. 1, 75--84 (2016; Zbl 1356.08001) Full Text: DOI arXiv
Bulatov, Andrei A.; Hedayaty, Amir Galois correspondence for counting quantifiers. (English) Zbl 1394.08009 J. Mult.-Val. Log. Soft Comput. 24, No. 5-6, 405-424 (2015). MSC: 08A70 08A40 06A15 68Q25 PDFBibTeX XMLCite \textit{A. A. Bulatov} and \textit{A. Hedayaty}, J. Mult.-Val. Log. Soft Comput. 24, No. 5--6, 405--424 (2015; Zbl 1394.08009) Full Text: arXiv Link
Bodirsky, Manuel The complexity of constraint satisfaction problems (invited talk). (English) Zbl 1355.68111 Mayr, Ernst W. (ed.) et al., 32nd international symposium on theoretical aspects of computer science, STACS’15, Garching, Germany, March 4–7, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-78-1). LIPIcs – Leibniz International Proceedings in Informatics 30, 2-9 (2015). MSC: 68Q25 08A70 PDFBibTeX XMLCite \textit{M. Bodirsky}, LIPIcs -- Leibniz Int. Proc. Inform. 30, 2--9 (2015; Zbl 1355.68111) Full Text: DOI
Bodirsky, Manuel; Pinsker, Michael Schaefer’s theorem for graphs. (English) Zbl 1333.05194 J. ACM 62, No. 3, Article No. 19, 52 p. (2015). MSC: 05C55 03B70 05C80 08A70 68Q25 PDFBibTeX XMLCite \textit{M. Bodirsky} and \textit{M. Pinsker}, J. ACM 62, No. 3, Article No. 19, 52 p. (2015; Zbl 1333.05194) Full Text: DOI arXiv
Barto, Libor The constraint satisfaction problem and universal algebra. (English) Zbl 1336.68113 Bull. Symb. Log. 21, No. 3, 319-337 (2015). MSC: 68Q25 08A70 08B05 68Q17 PDFBibTeX XMLCite \textit{L. Barto}, Bull. Symb. Log. 21, No. 3, 319--337 (2015; Zbl 1336.68113) Full Text: DOI
Bulín, Jakub; Delic, Dejan; Jackson, Marcel; Niven, Todd A finer reduction of constraint problems to digraphs. (English) Zbl 1409.05094 Log. Methods Comput. Sci. 11, No. 4, Paper No. 18, 33 p. (2015). MSC: 05C20 05C60 08A35 68R10 68Q15 PDFBibTeX XMLCite \textit{J. Bulín} et al., Log. Methods Comput. Sci. 11, No. 4, Paper No. 18, 33 p. (2015; Zbl 1409.05094) Full Text: DOI arXiv
Thapper, Johan; Živný, Stanislav Necessary conditions for tractability of valued CSPs. (English) Zbl 1347.08009 SIAM J. Discrete Math. 29, No. 4, 2361-2384 (2015). MSC: 08A70 68Q25 68Q17 PDFBibTeX XMLCite \textit{J. Thapper} and \textit{S. Živný}, SIAM J. Discrete Math. 29, No. 4, 2361--2384 (2015; Zbl 1347.08009) Full Text: DOI arXiv
Bergman, Clifford; Failing, David Commutative idempotent groupoids and the constraint satisfaction problem. (English) Zbl 1322.08003 Algebra Univers. 73, No. 3-4, 391-417 (2015). Reviewer: Anna Romanowska (Warsaw) MSC: 08A70 68Q25 20N02 08B25 PDFBibTeX XMLCite \textit{C. Bergman} and \textit{D. Failing}, Algebra Univers. 73, No. 3--4, 391--417 (2015; Zbl 1322.08003) Full Text: DOI arXiv Link
Carvalho, Catarina; Egri, Laszlo; Jackson, Marcel; Niven, Todd On Maltsev digraphs. (English) Zbl 1308.05053 Electron. J. Comb. 22, No. 1, Research Paper P1.47, 32 p. (2015). MSC: 05C20 05C25 05C60 05C75 05C38 08A70 PDFBibTeX XMLCite \textit{C. Carvalho} et al., Electron. J. Comb. 22, No. 1, Research Paper P1.47, 32 p. (2015; Zbl 1308.05053) Full Text: Link
Chen, Hubie An algebraic hardness criterion for surjective constraint satisfaction. (English) Zbl 1308.08001 Algebra Univers. 72, No. 4, 393-401 (2014). Reviewer: Ivan Chajda (Přerov) MSC: 08A70 03C05 68Q17 PDFBibTeX XMLCite \textit{H. Chen}, Algebra Univers. 72, No. 4, 393--401 (2014; Zbl 1308.08001) Full Text: DOI arXiv
Bulín, Jakub Decidability of absorption in relational structures of bounded width. (English) Zbl 1307.08008 Algebra Univers. 72, No. 1, 15-28 (2014). Reviewer: Pedro Sánchez Terraf (Córdoba) MSC: 08B05 08A70 08B10 68Q17 PDFBibTeX XMLCite \textit{J. Bulín}, Algebra Univers. 72, No. 1, 15--28 (2014; Zbl 1307.08008) Full Text: DOI
Lagerkvist, Victor Weak bases of Boolean co-clones. (English) Zbl 1296.68080 Inf. Process. Lett. 114, No. 9, 462-468 (2014). MSC: 68Q25 08A40 08A70 PDFBibTeX XMLCite \textit{V. Lagerkvist}, Inf. Process. Lett. 114, No. 9, 462--468 (2014; Zbl 1296.68080) Full Text: DOI arXiv
Bulatov, Andrei A. The complexity of the counting constraint satisfaction problem. (English) Zbl 1281.68130 J. ACM 60, No. 5, Article No. 34, 41 p. (2013). MSC: 68Q25 08A40 08A70 68Q15 68T20 PDFBibTeX XMLCite \textit{A. A. Bulatov}, J. ACM 60, No. 5, Article No. 34, 41 p. (2013; Zbl 1281.68130) Full Text: DOI
Cohen, David A.; Cooper, Martin C.; Creed, Páidí; Jeavons, Peter G.; Živný, Stanislav An algebraic theory of complexity for discrete optimization. (English) Zbl 1305.08007 SIAM J. Comput. 42, No. 5, 1915-1939 (2013). Reviewer: Václav Koubek (Praha) MSC: 08A70 06A15 68W40 68Q25 68Q17 90C27 PDFBibTeX XMLCite \textit{D. A. Cohen} et al., SIAM J. Comput. 42, No. 5, 1915--1939 (2013; Zbl 1305.08007) Full Text: DOI arXiv Link
Jackson, Marcel; Trotta, Belinda Constraint satisfaction, irredundant axiomatisability and continuous colouring. (English) Zbl 1294.03021 Stud. Log. 101, No. 1, 65-94 (2013). MSC: 03C07 03C13 03C98 08C15 68T20 PDFBibTeX XMLCite \textit{M. Jackson} and \textit{B. Trotta}, Stud. Log. 101, No. 1, 65--94 (2013; Zbl 1294.03021) Full Text: DOI
Barto, Libor Finitely related algebras in congruence distributive varieties have near unanimity terms. (English) Zbl 1283.08009 Can. J. Math. 65, No. 1, 3-21 (2013). Reviewer: Hernando Gaitán (Bogotá) MSC: 08B05 08A02 08B10 PDFBibTeX XMLCite \textit{L. Barto}, Can. J. Math. 65, No. 1, 3--21 (2013; Zbl 1283.08009) Full Text: DOI
Bodirsky, Manuel; Hils, Martin; Martin, Barnaby On the scope of the universal-algebraic approach to constraint satisfaction. (English) Zbl 1308.68062 Log. Methods Comput. Sci. 8, No. 3, Paper No. 13, 30 p. (2012). MSC: 68Q25 03C07 08A70 68T20 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Log. Methods Comput. Sci. 8, No. 3, Paper No. 13, 30 p. (2012; Zbl 1308.68062) Full Text: DOI
Bodirsky, Manuel; Jonsson, Peter; von Oertzen, Timo Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction. (English) Zbl 1283.68160 J. Log. Comput. 22, No. 3, 643-660 (2012). MSC: 68Q25 08A70 68Q15 90C05 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., J. Log. Comput. 22, No. 3, 643--660 (2012; Zbl 1283.68160) Full Text: DOI arXiv
Barto, Libor; Kozik, Marcin Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem. (English) Zbl 1239.08002 Log. Methods Comput. Sci. 8, No. 1, Paper No. 7, 26 p. (2012). MSC: 08A70 68Q17 68Q25 PDFBibTeX XMLCite \textit{L. Barto} and \textit{M. Kozik}, Log. Methods Comput. Sci. 8, No. 1, Paper No. 7, 26 p. (2012; Zbl 1239.08002) Full Text: DOI arXiv
Vargas García, Edith Mireya Clausal relations and \(C\)-clones. (English) Zbl 1285.08002 Dresden: TU Dresden, Fakultät Mathematik und Naturwissenschaften (Diss. 2011). vi, 108 p. (2011). MSC: 08-02 08A02 08A30 08A40 08A62 68Q25 PDFBibTeX XMLCite \textit{E. M. Vargas García}, Clausal relations and \(C\)-clones. Dresden: TU Dresden, Fakultät Mathematik und Naturwissenschaften (Diss. 2011) (2011; Zbl 1285.08002)
Romov, Boris A. Positive primitive structures. (English) Zbl 1236.03028 J. Mult.-Val. Log. Soft Comput. 17, No. 5-6, 581-589 (2011). MSC: 03C15 03C10 08A40 PDFBibTeX XMLCite \textit{B. A. Romov}, J. Mult.-Val. Log. Soft Comput. 17, No. 5--6, 581--589 (2011; Zbl 1236.03028)
Creignou, Nadia; Schnoor, Henning; Schnoor, Ilka Nonuniform Boolean constraint satisfaction problems with cardinality constraint. (English) Zbl 1351.68114 ACM Trans. Comput. Log. 11, No. 4, Article No. 24, 32 p. (2010). MSC: 68Q25 06A15 08A70 PDFBibTeX XMLCite \textit{N. Creignou} et al., ACM Trans. Comput. Log. 11, No. 4, Article No. 24, 32 p. (2010; Zbl 1351.68114) Full Text: DOI
Barto, Libor; Stanovský, David Polymorphisms of small digraphs. (English) Zbl 1289.05446 Novi Sad J. Math. 40, No. 2, 95-109 (2010). Reviewer: Sonja Čukić (Beograd) MSC: 05C85 05C20 08A02 68R10 08A70 PDFBibTeX XMLCite \textit{L. Barto} and \textit{D. Stanovský}, Novi Sad J. Math. 40, No. 2, 95--109 (2010; Zbl 1289.05446)
Bodirsky, Manuel; Chen, Hubie Quantified equality constraints. (English) Zbl 1220.68058 SIAM J. Comput. 39, No. 8, 3682-3699 (2010). MSC: 68Q25 03C13 03C35 08A70 68Q17 PDFBibTeX XMLCite \textit{M. Bodirsky} and \textit{H. Chen}, SIAM J. Comput. 39, No. 8, 3682--3699 (2010; Zbl 1220.68058) Full Text: DOI
Idziak, Paweł; Marković, Petar; McKenzie, Ralph; Valeriote, Matthew; Willard, Ross Tractability and learnability arising from algebras with few subpowers. (English) Zbl 1216.68129 SIAM J. Comput. 39, No. 7, 3023-3037 (2010). MSC: 68Q25 08A70 68Q32 PDFBibTeX XMLCite \textit{P. Idziak} et al., SIAM J. Comput. 39, No. 7, 3023--3037 (2010; Zbl 1216.68129) Full Text: DOI
Feder, Tomás; Hell, Pavol; Jonsson, Peter; Krokhin, Andrei; Nordh, Gustav Retractions to pseudoforests. (English) Zbl 1215.05063 SIAM J. Discrete Math. 24, No. 1, 101-112 (2010). MSC: 05C15 08A70 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., SIAM J. Discrete Math. 24, No. 1, 101--112 (2010; Zbl 1215.05063) Full Text: DOI
Berman, Joel; Idziak, Paweł; Markovic, Petar; McKenzie, Ralph; Valeriote, Matthew; Willard, Ross Varieties with few subalgebras of powers. (English) Zbl 1190.08004 Trans. Am. Math. Soc. 362, No. 3, 1445-1473 (2010). MSC: 08B05 08A30 08A70 68Q25 PDFBibTeX XMLCite \textit{J. Berman} et al., Trans. Am. Math. Soc. 362, No. 3, 1445--1473 (2010; Zbl 1190.08004) Full Text: DOI
Kun, Gábor; Szegedy, Mario A new line of attack on the dichotomy conjecture. (English) Zbl 1304.68076 Proceedings of the 41st annual ACM symposium on theory of computing, STOC ’09. Bethesda, MD, USA, May 31 – June 2, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-613-7). 725-734 (2009). MSC: 68Q25 08A40 68Q17 PDFBibTeX XMLCite \textit{G. Kun} and \textit{M. Szegedy}, in: Proceedings of the 41st annual ACM symposium on theory of computing, STOC '09. Bethesda, MD, USA, May 31 -- June 2, 2009. New York, NY: Association for Computing Machinery (ACM). 725--734 (2009; Zbl 1304.68076) Full Text: DOI Link
Barto, Libor; Kozik, Marcin Congruence distributivity implies bounded width. (English) Zbl 1205.68529 SIAM J. Comput. 39, No. 4, 1531-1542 (2009). MSC: 68W40 08A70 08B10 68R10 68T20 PDFBibTeX XMLCite \textit{L. Barto} and \textit{M. Kozik}, SIAM J. Comput. 39, No. 4, 1531--1542 (2009; Zbl 1205.68529) Full Text: DOI
Carvalho, Catarina; Dalmau, Víctor; Marković, Petar; Maróti, Miklós CD(4) has bounded width. (English) Zbl 1190.08003 Algebra Univers. 60, No. 3, 293-307 (2009). MSC: 08A70 08B10 68Q25 PDFBibTeX XMLCite \textit{C. Carvalho} et al., Algebra Univers. 60, No. 3, 293--307 (2009; Zbl 1190.08003) Full Text: DOI arXiv
Barto, Libor; Kozik, Marcin; Niven, Todd The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell). (English) Zbl 1191.68460 SIAM J. Comput. 38, No. 5, 1782-1802 (2009). MSC: 68R10 08A70 PDFBibTeX XMLCite \textit{L. Barto} et al., SIAM J. Comput. 38, No. 5, 1782--1802 (2009; Zbl 1191.68460) Full Text: DOI Link
Larose, Benoit; Valeriote, Matt; Zádori, László Omitting types, bounded width and the ability to count. (English) Zbl 1178.68289 Int. J. Algebra Comput. 19, No. 5, 647-668 (2009). MSC: 68Q25 08A72 08B05 PDFBibTeX XMLCite \textit{B. Larose} et al., Int. J. Algebra Comput. 19, No. 5, 647--668 (2009; Zbl 1178.68289) Full Text: DOI
Romov, Boris A. Homogeneous and strictly homogeneous criteria for partial structures. (English) Zbl 1179.08002 Discrete Appl. Math. 157, No. 4, 699-709 (2009). Reviewer: Yuri Movsisyan (Yerevan) MSC: 08A55 06A15 08A02 03C07 PDFBibTeX XMLCite \textit{B. A. Romov}, Discrete Appl. Math. 157, No. 4, 699--709 (2009; Zbl 1179.08002) Full Text: DOI