Polynomial-time Computation: Opening the Blackboxes in Constraint Problems

Información del proyecto

POCOCOP

Identificador del acuerdo de subvención: 101071674

DOI

10.3030/101071674

Fecha de la firma de la CE 19 Enero 2023

Fecha de inicio 1 Marzo 2023

Fecha de finalización 28 Febrero 2029

Financiado con arreglo a

• European Research Council (ERC)

Coste total

€ 7 932 935,00

Aportación de la UE

€ 7 932 935,00

Coordinado por

TECHNISCHE UNIVERSITAET DRESDEN
Germany

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Peer reviewed articles (40)

On the non-measurability of $$\omega $$-categorical Hrushovski constructions

Autores: Paolo Marimon
Publicado en: Archive for Mathematical Logic, Edición 64, 2024, ISSN 0933-5846
Editor: Springer Science and Business Media LLC
DOI: 10.1007/S00153-024-00943-4

Mal’cev complexes

Autores: Andrew Moorhead
Publicado en: International Journal of Algebra and Computation, Edición 34, 2024, ISSN 0218-1967
Editor: World Scientific Pub Co Pte Ltd
DOI: 10.1142/S0218196724500371

An Algebraic Proof of the Dichotomy for Graph Orientation Problems with Forbidden Tournaments

Autores: Roman Feller; Michael Pinsker
Publicado en: SIAM Journal on Discrete Mathematics, Edición 40/1, 2026, ISSN 1095-7146
Editor: Society for Industrial and Applied Mathematics
DOI: 10.48550/ARXIV.2405.20263

The Sherali–Adams and Weisfeiler–Leman Hierarchies in (Promise Valued) Constraint Satisfaction Problems

Autores: Libor Barto; Silvia Butti; Victor Dalmau
Publicado en: ACM Transactions on Computation Theory, Edición 18/1, 2026, ISSN 1942-3462
Editor: Association for Computing Machinery
DOI: 10.48550/ARXIV.2401.16998

Network satisfaction problems solved by <i>k</i> -consistency

Autores: Manuel Bodirsky, Simon Knäuer
Publicado en: International Journal of Algebra and Computation, Edición 36, 2025, ISSN 0218-1967
Editor: World Scientific Pub Co Pte Ltd
DOI: 10.1142/S0218196726500013

Forbidden Tournaments and the Orientation Completion Problem

Autores: Manuel Bodirsky, Santiago Guzmán-Pro
Publicado en: SIAM Journal on Discrete Mathematics, Edición 39, 2025, ISSN 0895-4801
Editor: Society for Industrial & Applied Mathematics (SIAM)
DOI: 10.1137/23M1604849

Big Ramsey degrees and infinite languages

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

Twenty years of Nešetřil’s classification programme of Ramsey classes

Autores: Jan Hubička, Matěj Konečný
Publicado en: Computer Science Review, Edición 59, 2026, ISSN 1574-0137
Editor: Elsevier BV
DOI: 10.1016/J.COSREV.2025.100814

Multisorted Boolean clones determined by binary relations up to minion homomorphisms

Autores: Libor Barto, Maryia Kapytka
Publicado en: Algebra universalis, Edición 86, 2024, ISSN 0002-5240
Editor: Springer Science and Business Media LLC
DOI: 10.1007/S00012-024-00878-0

Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable

Autores: Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman
Publicado en: Algorithmica, Edición 88, 2026, ISSN 0178-4617
Editor: Springer Science and Business Media LLC
DOI: 10.1007/S00453-026-01374-8

Algebra Universalis

Autores: Barto, Libor; Kapytka, Maryia
Publicado en: Algebra universalis, Edición 86, 2024, ISSN 0002-5240
Editor: Birkhauser Verlag
DOI: 10.48550/ARXIV.2407.16513

Forbidden Tournaments and the Orientation Completion Problem

Autores: Manuel Bodirsky, Santiago Guzmán-Pro
Publicado en: SIAM Journal on Discrete Mathematics, Edición 39, 2025, ISSN 0895-4801
Editor: Society for Industrial & Applied Mathematics (SIAM)
DOI: 10.1137/23M1604849

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

Autores: Albert Vucaj, Dmitriy Zhuk
Publicado en: Algebra universalis, Edición 85, 2024, ISSN 0002-5240
Editor: Springer Science and Business Media LLC
DOI: 10.1007/s00012-024-00852-w

Generalisations of matrix partitions: Complexity and obstructions

Autores: Alexey Barsukov, Mamadou Moustapha Kanté
Publicado en: Theoretical Computer Science, Edición 1007, 2024, ISSN 0304-3975
Editor: Elsevier BV
DOI: 10.1016/j.tcs.2024.114652

SIAM Journal on Computing

Autores: Antoine Mottet; Tomáš Nagy; Michael Pinsker; Michał Wrona
Publicado en: SIAM Journal on Computing, Edición 53/6, 2024, ISSN 0097-5397
Editor: SIAM
DOI: 10.1137/22M1538934

Ramsey expansions of metrically homogeneous graphs

Autores: Andrés Aranda, David Bradley-Williams, Jan Hubička, Miltiadis Karamanlis, Michael Kompatscher, Matěj Konečný, Micheal Pawliuk
Publicado en: European Journal of Combinatorics, Edición 132, 2026, ISSN 0195-6698
Editor: Elsevier BV
DOI: 10.1016/J.EJC.2025.104255

MIXED IDENTITIES FOR OLIGOMORPHIC AUTOMORPHISM GROUPS

Autores: MANUEL BODIRSKY, JAKOB SCHNEIDER, ANDREAS THOM
Publicado en: The Journal of Symbolic Logic, 2025, ISSN 0022-4812
Editor: Cambridge University Press (CUP)
DOI: 10.1017/JSL.2025.10123

A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory

Autores: Manuel Bodirsky, Bertalan Bodor
Publicado en: ACM Transactions on Computation Theory, Edición 16, 2024, ISSN 1942-3454
Editor: Association for Computing Machinery (ACM)
DOI: 10.1145/3649445

GMSNP and Finite Structures

Autores: Santiago Guzmán-Pro
Publicado en: ACM Transactions on Computation Theory, Edición 18, 2026, ISSN 1942-3454
Editor: Association for Computing Machinery (ACM)
DOI: 10.1145/3774645

The Generic Circular Triangle‐Free Graph

Autores: Manuel Bodirsky, Santiago Guzmán‐Pro
Publicado en: Journal of Graph Theory, Edición 109, 2025, ISSN 0364-9024
Editor: Wiley
DOI: 10.1002/JGT.23235

Computational complexity of covering coloured mixed multigraphs with simple degree partitions

Autores: Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, Michaela Seifrtová
Publicado en: Discrete Applied Mathematics, Edición 385, 2026, ISSN 0166-218X
Editor: Elsevier BV
DOI: 10.1016/J.DAM.2026.01.019

International Journal of Algebra and Computation

Autores: Moorhead, Andrew
Publicado en: International Journal of Algebra and Computation, Edición Volume 34 (2024), 2024, ISSN 0218-1967
Editor: World Scientific Publishing
DOI: 10.1142/S0218196724500371

Collapsing the Bounded Width Hierarchy for Infinite-Domain Constraint Satisfaction Problems: When Symmetries Are Enough

Autores: Antoine Mottet, Tomáš Nagy, Michael Pinsker, Michał Wrona
Publicado en: SIAM Journal on Computing, Edición 53, 2024, ISSN 0097-5397
Editor: Society for Industrial & Applied Mathematics (SIAM)
DOI: 10.1137/22M1538934

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

Autores: MICHAEL PINSKER, CLEMENS SCHINDLER
Publicado en: The Journal of Symbolic Logic, 2024, ISSN 0022-4812
Editor: Cambridge University Press (CUP)
DOI: 10.1017/jsl.2023.81

The lattice of clones of self-dual operations collapsed

Autores: Manuel Bodirsky, Albert Vucaj, Dmitriy Zhuk
Publicado en: International Journal of Algebra and Computation, Edición 33, 2023, ISSN 0218-1967
Editor: World Scientific Pub Co Pte Ltd
DOI: 10.1142/S0218196723500327

INVARIANT KEISLER MEASURES FOR $\omega $-CATEGORICAL STRUCTURES

Autores: PAOLO MARIMON
Publicado en: The Journal of Symbolic Logic, Edición 90, 2025, ISSN 0022-4812
Editor: Cambridge University Press (CUP)
DOI: 10.1017/JSL.2024.39

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

Autores: Antoine Mottet, Michael Pinsker
Publicado en: Journal of the ACM, Edición 71, 2024, ISSN 0004-5411
Editor: Association for Computing Machinery (ACM)
DOI: 10.1145/3689207

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

Autores: Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk
Publicado en: TheoretiCS, Edición Volume 3, 2024, ISSN 2751-4838
Editor: Centre pour la Communication Scientifique Directe (CCSD)
DOI: 10.46298/theoretics.24.14

Polish topologies on endomorphism monoids of relational structures

Autores: L. Elliott, J. Jonušas, J.D. Mitchell, Y. Péresse, M. Pinsker
Publicado en: Advances in Mathematics, Edición 431, 2023, ISSN 0001-8708
Editor: Elsevier BV
DOI: 10.1016/j.aim.2023.109214

EPPA numbers of graphs

Autores: David Bradley-Williams, Peter J. Cameron, Jan Hubička, Matěj Konečný
Publicado en: Journal of Combinatorial Theory, Series B, Edición 170, 2025, ISSN 0095-8956
Editor: Elsevier BV
DOI: 10.1016/J.JCTB.2024.09.003

SIAM Journal on Discrete Mathematics

Autores: Manuel Bodirsky; Santiago Guzmán-Pro
Publicado en: SIAM Journal on Discrete Mathematics, Edición 39/1, 2025, ISSN 0895-4801
Editor: Society for Industrial and Applied Mathematics
DOI: 10.48550/ARXIV.2309.08327

Archive for Mathematical Logic

Autores: Marimon, Paolo
Publicado en: Archive for Mathematical Logic, 2024, ISSN 0933-5846
Editor: Springer
DOI: 10.1007/S00153-024-00943-4

Infinitary primitive positive definability over the real numbers with convex relations

Autores: Sebastian Meyer
Publicado en: Algebra universalis, Edición 86, 2025, ISSN 0002-5240
Editor: Springer Science and Business Media LLC
DOI: 10.1007/S00012-025-00893-9

Complexity Classification Transfer for CSPs via Algebraic Products

Autores: Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Žaneta Semanišinová
Publicado en: SIAM Journal on Computing, Edición 53, 2024, ISSN 0097-5397
Editor: Society for Industrial & Applied Mathematics (SIAM)
DOI: 10.1137/22M1534304

\(\boldsymbol{\Pi_2^P}\) vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem

Autores: Dmitriy Zhuk
Publicado en: SIAM Journal on Computing, Edición 54-6, 2025, ISSN 1095-7111
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/25M1725747

"Primitive elements of finite fields <mml:math xmlns:mml=""http://www.w3.org/1998/Math/MathML"" altimg=""si1.svg""><mml:msub><mml:mrow><mml:mi mathvariant=""double-struck"">F</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>q</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msub></mml:math> avoiding affine hyperplanes for q = 4 and q = 5"

Autores: Philipp A. Grzywaczyk, Arne Winterhof
Publicado en: Finite Fields and Their Applications, Edición 96, 2024, ISSN 1071-5797
Editor: Elsevier BV
DOI: 10.1016/J.FFA.2024.102416

On guarded extensions of MMSNP

Autores: Alexey Barsukov, Florent R. Madelaine
Publicado en: Logical Methods in Computer Science, Edición Volume 21, Edición 4, 2025, ISSN 1860-5974
Editor: Centre pour la Communication Scientifique Directe (CCSD)
DOI: 10.46298/LMCS-21(4:15)2025

Primitive elements of finite fields avoiding affine hyperplanes for q = 4 and q = 5

Autores: Grzywaczyk, Philipp Alexander; Winterhof, Arne
Publicado en: Finite Fields and Their Applications, Edición Volume 96, 2024, ISSN 1071-5797
Editor: Elsevier
DOI: 10.1016/j.ffa.2024.102416

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability

Autores: Prem Nigam Kar; David E. Roberson; Tim Seppelt; Peter Zeman
Publicado en: Quantum, Edición 10, 2026, ISSN 2521-327X
Editor: "{Verein zur F{\""{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}"
DOI: 10.48550/ARXIV.2407.10635

Finite algebras with Hom-sets of polynomial size

Autores: Libor Barto, Antoine Mottet
Publicado en: Transactions of the American Mathematical Society, 2024, ISSN 0002-9947
Editor: American Mathematical Society (AMS)
DOI: 10.1090/TRAN/9262

Conference proceedings (19)

Nonuniform Deterministic Finite Automata over Finite Algebraic Structures

Autores: Paweł M. Idziak, Piotr Kawałek, and Jacek Krzaczkowski
Publicado en: 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), 2025, ISSN 1868-8969
Editor: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/LIPICS.ICALP.2025.161

Violating Constant Degree Hypothesis Requires Breaking Symmetry

Autores: Piotr Kawałek, Armin Weiss
Publicado en: 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), 2025, ISSN 1868-8969
Editor: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/LIPICS.STACS.2025.58

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability

Autores: Prem Nigam Kar, David E. Roberson, Tim Seppelt, and Peter Zeman
Publicado en: 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), 2025, ISSN 1868-8969
Editor: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/LIPICS.ICALP.2025.105

The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems

Autores: Manuel Bodirsky, Žaneta Semanišinová, Carsten Lutz
Publicado en: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Edición 27, 2024
Editor: ACM
DOI: 10.1145/3661814.3662071

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

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

Symmetric Linear Arc Monadic Datalog and Gadget Reductions

Autores: Manuel Bodirsky, Florian Starke
Publicado en: 28th International Conference on Database Theory (ICDT 2025), 2025, ISSN 1868-8969
Editor: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/LIPICS.ICDT.2025.13

Network Satisfaction Problems Solved by k-Consistency

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

Algebraic Approach to Approximation

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

Temporal Valued Constraint Satisfaction Problems

Autores: Manuel Bodirsky, Édouard Bonnet, and Žaneta Semanišinová
Publicado en: 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), 2025, ISSN 1868-8969
Editor: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/LIPICS.MFCS.2025.24

Binary symmetries of tractable non-rigid structures

Autores: Paolo Marimon, Michael Pinsker
Publicado en: 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2025
Editor: IEEE
DOI: 10.1109/LICS65433.2025.00036

Circuit Equivalence in 2-Nilpotent Algebras

Autores: Piotr Kawałek, Michael Kompatscher, Jacek Krzaczkowski
Publicado en: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), 2024, ISSN 1868-8969
Editor: "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

Autores: Dmitriy Zhuk
Publicado en: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024
Editor: IEEE
DOI: 10.1109/FOCS61266.2024.00043

Reducing Stochastic Games to Semidefinite Programming

Autores: Manuel Bodirsky, Georg Loho, and Mateusz Skomra
Publicado en: 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), 2025, ISSN 1868-8969
Editor: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/LIPICS.ICALP.2025.145

Containment for Guarded Monotone Strict NP

Autores: Alexey Barsukov, Michael Pinsker, and Jakub Rydval
Publicado en: 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), 2025, ISSN 1868-8969
Editor: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/LIPICS.ICALP.2025.140

Hereditary First-Order Logic: the Tractable Quantifier Prefix Classes

Autores: Manuel Bodirsky and Santiago Guzmán-Pro
Publicado en: 34th EACSL Annual Conference on Computer Science Logic (CSL 2026), 2026, ISSN 1868-8969
Editor: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/LIPICS.CSL.2026.6

Identifying Tractable Quantified Temporal Constraints Within Ord-Horn

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

A CSP approach to Graph Sandwich Problems

Autores: Manuel Bodirsky, Santiago Guzmán-Pro
Publicado en: Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2026
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978971.85

The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems

Autores: Johanna Brunar, Marcin Kozik, Tomáš Nagy, Michael Pinsker
Publicado en: 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2025
Editor: IEEE
DOI: 10.1109/LICS65433.2025.00037

Restricted CSPs and F-Free Digraph Algorithmics

Autores: Santiago Guzmán-Pro and Barnaby Martin
Publicado en: 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), 2025, ISSN 1868-8969
Editor: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/LIPICS.ICALP.2025.158

Book chapters (2)

Resolving Sets in Temporal Graphs

Autores: Jan Bok, Antoine Dailly, Tuomo Lehtilä
Publicado en: Lecture Notes in Computer Science, Combinatorial Algorithms, 2024, ISBN 978-3-031-63020-0
Editor: Springer Nature Switzerland
DOI: 10.1007/978-3-031-63021-7_22

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

Autores: Sebastian Meyer, Jakub Opršal
Publicado en: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.154