Symmetry in Computational Complexity

Project Information

CoCoSym

Grant agreement ID: 771005

DOI

10.3030/771005

Project closed

EC signature date 17 January 2018

Start date 1 February 2018

End date 31 January 2023

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 211 375,00

EU contribution

€ 1 211 375,00

Coordinated by

UNIVERZITA KARLOVA
Czechia

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Conference proceedings (16)

Weisfeiler-Leman Invariant Promise Valued CSPs

Author(s): Barto, Libor; Butti, Silvia
Published in: 28th International Conference on Principles and Practice of Constraint Programming (CP 2022), 2022, Page(s) 4:1--4:17, ISBN 978-3-95977-240-2
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.cp.2022.4

The complete classification for quantified equality constraints

Author(s): Dmitriy Zhuk, Barnaby Martin, Michal Wrona
Published in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Issue 1, 2023, Page(s) 2746-2760, ISBN 978-1-61197-755-4
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch103

Hrushovski’s Encoding and ω-Categorical CSP Monsters

Author(s): Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker
Published in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Issue 1/year, 2020, Page(s) 131:1--131:17, ISBN 978-3-95977-138-2
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.icalp.2020.131

Minimal taylor algebras as a common framework for the three algebraic approaches to the CSP

Author(s): Libor Barto; Zarathustra Brady; Andrei A. Bulatov; Marcin Kozik; Dmitriy Zhuk
Published in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Page(s) 1-13
Publisher: IEEE Computer Society
DOI: 10.1109/lics52264.2021.9470557

Combinatorial Gap Theorem and Reductions between Promise CSPs

Author(s): Barto, Libor; Kozik, Marcin
Published in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Page(s) 1204-1220, ISBN 978-1-61197-707-3
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977073.50

Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case

Author(s): Barto, Libor; Battistelli, Diego; Berg, Kevin M.
Published in: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), 2021, Page(s) 10:1--10:16, ISBN 978-3-95977-180-1
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.stacs.2021.10

Fixed-Template Promise Model Checking Problems

Author(s): Asimi, Kristina; Barto, Libor; Butti, Silvia
Published in: 28th International Conference on Principles and Practice of Constraint Programming (CP 2022), 2022, Page(s) 2:1--2:17, ISBN 978-3-95977-240-2
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.cp.2022.2

Sensitive instances of the Constraint Satisfaction Problem

Author(s): Barto, Libor; Kozik, Marcin; Tan, Johnson; Valeriote, Matt
Published in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Issue 1/year, 2020, Page(s) 110:1--110:18, ISBN 978-3-95977-138-2
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.icalp.2020.110

Finitely Tractable Promise Constraint Satisfaction Problems

Author(s): Asimi, Kristina; Barto, Libor
Published in: 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), 2021, Page(s) 11:1--11:16, ISBN 978-3-95977-201-3
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.mfcs.2021.11

Smooth Approximations and Relational Width Collapses

Author(s): Mottet, Antoine; Nagy, Tomáš; Pinsker, Michael; Wrona, Michał
Published in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Issue 1/year, 2021, Page(s) 138:1--138:20, ISBN 978-3-95977-195-5
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.icalp.2021.138

Promises Make Finite (Constraint Satisfaction) Problems Infinitary

Author(s): Libor Barto
Published in: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, Page(s) 1-8, ISBN 978-1-7281-3608-0
Publisher: IEEE
DOI: 10.1109/lics.2019.8785671

Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)

Author(s): Manuel Bodirsky, Antoine Mottet, Miroslav Olsak, Jakub Oprsal, Michael Pinsker, Ross Willard
Published in: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, Page(s) 1-12, ISBN 978-1-7281-3608-0
Publisher: IEEE
DOI: 10.1109/lics.2019.8785883

enNew Techniques for Universality in Unambiguous Register Automata

Author(s): Czerwiński, Wojciech; Mottet, Antoine; Quaas, Karin
Published in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Issue 1/year, 2021, Page(s) 129:1--129:16, ISBN 978-3-95977-195-5
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.icalp.2021.129

QCSP monsters and the demise of the chen conjecture

Author(s): Dmitriy Zhuk, Barnaby Martin
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, Issue 1/year, 2020, Page(s) 91-104, ISBN 9781450369794
Publisher: ACM
DOI: 10.1145/3357713.3384232

Smooth approximations and CSPs over finitely bounded homogeneous structures

Author(s): Mottet, Antoine; Pinsker, Michael
Published in: LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, 2022, Page(s) 1-13, ISBN 978-1-4503-9351-5
Publisher: Association for Computing Machinery
DOI: 10.1145/3531130.3533353

Constraint satisfaction problems over finite structures

Author(s): Libor Barto; William DeMeo; Antoine Mottet
Published in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Page(s) 1-13
Publisher: IEEE Computer Society
DOI: 10.1109/lics52264.2021.9470670

Peer reviewed articles (11)

QCSP monsters and the demise of the chen conjecture

Author(s): Dmitriy Zhuk; Barnaby Martin
Published in: Journal of the ACM, Issue 69/5, 2022, Page(s) 1-44, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3563820

When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems

Author(s): Pierre Gillibert; Julius Jonušas; Michael Kompatscher; Antoine Mottet; Michael Pinsker
Published in: SIAM Journal on Computing, Issue 51/2, 2022, Page(s) 175-213, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1383471

$\omega $-categorical structures avoiding height 1 identities

Author(s): Manuel Bodirsky, Antoine Mottet, Miroslav Olšák, Jakub Opršal, Michael Pinsker, Ross Willard
Published in: Transactions of the American Mathematical Society, Issue 374/1, 2021, Page(s) 327-350, ISSN 0002-9947
Publisher: American Mathematical Society
DOI: 10.1090/tran/8179

A Proof of the CSP Dichotomy Conjecture

Author(s): Dmitriy Zhuk
Published in: Journal of the ACM, Issue 67/5, 2020, Page(s) 1-78, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3402029

A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP

Author(s): Manuel Bodirsky; Florent Madelaine; Antoine Mottet
Published in: SIAM Journal on Computing, Issue 00975397, 2021, Page(s) 1359-1409, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m128466x

CORES OVER RAMSEY STRUCTURES

Author(s): Antoine Mottet; Michael Pinsker
Published in: The Journal of Symbolic Logic, Issue 00224812, 2021, Page(s) 352–361, ISSN 0022-4812
Publisher: Association for Symbolic Logic
DOI: 10.1017/jsl.2021.6

Algebraic Approach to Promise Constraint Satisfaction

Author(s): Barto, Libor; Bulín, Jakub; Krokhin, Andrei; Opršal, Jakub
Published in: J. ACM, Issue 68/4, 2021, Page(s) 1-66, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3457606

Higher Kiss terms

Author(s): Moorhead, Andrew
Published in: International Journal of Algebra and Computation, Issue 02181967, 2022, Page(s) 1233-1259, ISSN 0218-1967
Publisher: World Scientific Publishing Co
DOI: 10.1142/s0218196722500539

The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata

Author(s): Antoine Mottet, Karin Quaas
Published in: Theory of Computing Systems, 2020, ISSN 1432-4350
Publisher: Springer Verlag
DOI: 10.1007/s00224-020-09997-2

Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)

Author(s): Libor Barto, Michael Pinsker
Published in: SIAM Journal on Computing, Issue 49/2, 2020, Page(s) 365-393, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1216213

Accessible set functors are universal

Author(s):  Barto Libor
Published in: Commentationes Mathematicae Universitatis Carolinae, Issue 60/4, 2020, Page(s) 497-508, ISSN 0010-2628
Publisher: Mathematical Institute of Charles University
DOI: 10.14712/1213-7243.2019.028

Book chapters (2)

Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps

Author(s): Libor Barto
Published in: Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings, Issue 11651, 2019, Page(s) 3-17, ISBN 978-3-030-25026-3
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-25027-0_1

The Containment Problem for Unambiguous Register Automata

Author(s): Mottet, Antoine; Quaas, Karin
Published in: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 2019, Page(s) 53:1--53:15, ISBN 978-3-95977-100-9
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2019.53