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 (15)

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

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

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

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

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

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

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

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

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 (8)

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

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

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: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/LIPIcs.ICALP.2024.148

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

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

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