Polynomial-time Computation: Opening the Blackboxes in Constraint Problems

Project Information

POCOCOP

Grant agreement ID: 101071674

DOI

10.3030/101071674

EC signature date 19 January 2023

Start date 1 March 2023

End date 28 February 2029

Funded under

• European Research Council (ERC)

Total cost

€ 7 932 935,00

EU contribution

€ 7 932 935,00

Coordinated by

TECHNISCHE UNIVERSITAET DRESDEN
Germany

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

Peer reviewed articles (15)

Forbidden Tournaments and the Orientation Completion Problem

Author(s): Manuel Bodirsky, Santiago Guzmán-Pro
Published in: SIAM Journal on Discrete Mathematics, Issue 39, 2025, ISSN 0895-4801
Publisher: Society for Industrial & Applied Mathematics (SIAM)
DOI: 10.1137/23M1604849

Big Ramsey degrees and infinite languages

Author(s): Samuel Braunfeld, David Chodounský, Noé de Rancourt, Jan Hubička, Jamal Kawach, Matěj Konečný
Published in: Advances in Combinatorics, 2024, ISSN 2517-5599
Publisher: Alliance of Diamond Open Access Journals
DOI: 10.19086/aic.2024.4

Algebra Universalis

Author(s): Barto, Libor; Kapytka, Maryia
Published in: Algebra universalis, Issue 86, 2024, ISSN 0002-5240
Publisher: Birkhauser Verlag
DOI: 10.48550/ARXIV.2407.16513

Submaximal clones over a three-element set up to minor-equivalence

Author(s): Albert Vucaj, Dmitriy Zhuk
Published in: Algebra universalis, Issue 85, 2024, ISSN 0002-5240
Publisher: Springer Science and Business Media LLC
DOI: 10.1007/s00012-024-00852-w

Generalisations of matrix partitions: Complexity and obstructions

Author(s): Alexey Barsukov, Mamadou Moustapha Kanté
Published in: Theoretical Computer Science, Issue 1007, 2024, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2024.114652

SIAM Journal on Computing

Author(s): Antoine Mottet; Tomáš Nagy; Michael Pinsker; Michał Wrona
Published in: SIAM Journal on Computing, Issue 53/6, 2024, ISSN 0097-5397
Publisher: SIAM
DOI: 10.1137/22M1538934

A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory

Author(s): Manuel Bodirsky, Bertalan Bodor
Published in: ACM Transactions on Computation Theory, Issue 16, 2024, ISSN 1942-3454
Publisher: Association for Computing Machinery (ACM)
DOI: 10.1145/3649445

ON THE ZARISKI TOPOLOGY ON ENDOMORPHISM MONOIDS OF OMEGA-CATEGORICAL STRUCTURES

Author(s): MICHAEL PINSKER, CLEMENS SCHINDLER
Published in: The Journal of Symbolic Logic, 2024, ISSN 0022-4812
Publisher: Cambridge University Press (CUP)
DOI: 10.1017/jsl.2023.81

Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures

Author(s): Antoine Mottet, Michael Pinsker
Published in: Journal of the ACM, Issue 71, 2024, ISSN 0004-5411
Publisher: Association for Computing Machinery (ACM)
DOI: 10.1145/3689207

Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras

Author(s): Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk
Published in: TheoretiCS, Issue Volume 3, 2024, ISSN 2751-4838
Publisher: Centre pour la Communication Scientifique Directe (CCSD)
DOI: 10.46298/theoretics.24.14

Polish topologies on endomorphism monoids of relational structures

Author(s): L. Elliott, J. Jonušas, J.D. Mitchell, Y. Péresse, M. Pinsker
Published in: Advances in Mathematics, Issue 431, 2023, ISSN 0001-8708
Publisher: Elsevier BV
DOI: 10.1016/j.aim.2023.109214

SIAM Journal on Discrete Mathematics

Author(s): Manuel Bodirsky; Santiago Guzmán-Pro
Published in: SIAM Journal on Discrete Mathematics, Issue 39/1, 2025, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.48550/ARXIV.2309.08327

Archive for Mathematical Logic

Author(s): Marimon, Paolo
Published in: Archive for Mathematical Logic, 2024, ISSN 0933-5846
Publisher: Springer
DOI: 10.1007/S00153-024-00943-4

Complexity Classification Transfer for CSPs via Algebraic Products

Author(s): Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Žaneta Semanišinová
Published in: SIAM Journal on Computing, Issue 53, 2024, ISSN 0097-5397
Publisher: Society for Industrial & Applied Mathematics (SIAM)
DOI: 10.1137/22M1534304

Finite algebras with Hom-sets of polynomial size

Author(s): Libor Barto, Antoine Mottet
Published in: Transactions of the American Mathematical Society, 2024, ISSN 0002-9947
Publisher: American Mathematical Society (AMS)
DOI: 10.1090/TRAN/9262

Conference proceedings (8)

The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems

Author(s): Manuel Bodirsky, Žaneta Semanišinová, Carsten Lutz
Published in: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Issue 27, 2024
Publisher: ACM
DOI: 10.1145/3661814.3662071

An Order out of Nowhere: A New Algorithm for Infinite-Domain CSPs

Author(s): Antoine Mottet, Tomáš Nagy, Michael Pinsker
Published in: 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), 2024
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.48550/ARXIV.2301.12977

Network Satisfaction Problems Solved by k-Consistency

Author(s): Manuel Bodirsky, Simon Knäuer
Published in: 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), 2023, ISSN 1868-8969
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/LIPIcs.ICALP.2023.116

Algebraic Approach to Approximation

Author(s): Libor Barto; Silvia Butti; Alexandr Kazda; Caterina Viola; Stanislav Živný
Published in: LICS '24: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024, ISBN 9798400706608
Publisher: Association for Computing Machinery
DOI: 10.48550/ARXIV.2401.15186

An Order out of Nowhere: A New Algorithm for Infinite-Domain CSPs

Author(s): Antoine Mottet, Tom Nagy, Michael Pinsker
Published in: 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), 2024
Publisher: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/LIPIcs.ICALP.2024.148

Circuit Equivalence in 2-Nilpotent Algebras

Author(s): Piotr Kawałek, Michael Kompatscher, Jacek Krzaczkowski
Published in: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), 2024, ISSN 1868-8969
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/LIPIcs.STACS.2024.45

$\prod_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem

Author(s): Dmitriy Zhuk
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024
Publisher: IEEE
DOI: 10.1109/FOCS61266.2024.00043

Identifying Tractable Quantified Temporal Constraints Within Ord-Horn

Author(s): Jakub Rydval, Žaneta Semanišinová, Michał Wrona
Published in: 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), 2024, ISSN 1868-8969
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/LIPIcs.ICALP.2024.151

Book chapters (2)

Resolving Sets in Temporal Graphs

Author(s): Jan Bok, Antoine Dailly, Tuomo Lehtilä
Published in: Lecture Notes in Computer Science, Combinatorial Algorithms, 2024, ISBN 978-3-031-63020-0
Publisher: Springer Nature Switzerland
DOI: 10.1007/978-3-031-63021-7_22

A topological proof of the Hell-Nešetřil dichotomy

Author(s): Sebastian Meyer, Jakub Opršal
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.154