Symmetry in Computational Complexity

Weisfeiler-Leman Invariant Promise Valued CSPs

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

The complete classification for quantified equality constraints

Autori: Dmitriy Zhuk, Barnaby Martin, Michal Wrona
Pubblicato in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Numero 1, 2023, Pagina/e 2746-2760, ISBN 978-1-61197-755-4
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch103

Hrushovski’s Encoding and ω-Categorical CSP Monsters

Autori: Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker
Pubblicato in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Numero 1/year, 2020, Pagina/e 131:1--131:17, ISBN 978-3-95977-138-2
Editore: "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

Autori: Libor Barto; Zarathustra Brady; Andrei A. Bulatov; Marcin Kozik; Dmitriy Zhuk
Pubblicato in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Pagina/e 1-13
Editore: IEEE Computer Society
DOI: 10.1109/lics52264.2021.9470557

Combinatorial Gap Theorem and Reductions between Promise CSPs

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

Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case

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

Fixed-Template Promise Model Checking Problems

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

Sensitive instances of the Constraint Satisfaction Problem

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

Finitely Tractable Promise Constraint Satisfaction Problems

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

Smooth Approximations and Relational Width Collapses

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

Promises Make Finite (Constraint Satisfaction) Problems Infinitary

Autori: Libor Barto
Pubblicato in: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, Pagina/e 1-8, ISBN 978-1-7281-3608-0
Editore: IEEE
DOI: 10.1109/lics.2019.8785671

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

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

enNew Techniques for Universality in Unambiguous Register Automata

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

QCSP monsters and the demise of the chen conjecture

Autori: Dmitriy Zhuk, Barnaby Martin
Pubblicato in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, Numero 1/year, 2020, Pagina/e 91-104, ISBN 9781450369794
Editore: ACM
DOI: 10.1145/3357713.3384232

Smooth approximations and CSPs over finitely bounded homogeneous structures

Autori: Mottet, Antoine; Pinsker, Michael
Pubblicato in: LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, 2022, Pagina/e 1-13, ISBN 978-1-4503-9351-5
Editore: Association for Computing Machinery
DOI: 10.1145/3531130.3533353

Constraint satisfaction problems over finite structures

Autori: Libor Barto; William DeMeo; Antoine Mottet
Pubblicato in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Pagina/e 1-13
Editore: IEEE Computer Society
DOI: 10.1109/lics52264.2021.9470670

QCSP monsters and the demise of the chen conjecture

Autori: Dmitriy Zhuk; Barnaby Martin
Pubblicato in: Journal of the ACM, Numero 69/5, 2022, Pagina/e 1-44, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3563820

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

Autori: Pierre Gillibert; Julius Jonušas; Michael Kompatscher; Antoine Mottet; Michael Pinsker
Pubblicato in: SIAM Journal on Computing, Numero 00975397, 2022, Pagina/e 175-213, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1383471

$\omega $-categorical structures avoiding height 1 identities

Autori: Manuel Bodirsky, Antoine Mottet, Miroslav Olšák, Jakub Opršal, Michael Pinsker, Ross Willard
Pubblicato in: Transactions of the American Mathematical Society, Numero 374/1, 2021, Pagina/e 327-350, ISSN 0002-9947
Editore: American Mathematical Society
DOI: 10.1090/tran/8179

A Proof of the CSP Dichotomy Conjecture

Autori: Dmitriy Zhuk
Pubblicato in: Journal of the ACM, Numero 67/5, 2020, Pagina/e 1-78, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3402029

A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP

Autori: Manuel Bodirsky; Florent Madelaine; Antoine Mottet
Pubblicato in: SIAM Journal on Computing, Numero 00975397, 2021, Pagina/e 1359-1409, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m128466x

CORES OVER RAMSEY STRUCTURES

Autori: Antoine Mottet; Michael Pinsker
Pubblicato in: The Journal of Symbolic Logic, Numero 00224812, 2021, Pagina/e 352–361, ISSN 0022-4812
Editore: Association for Symbolic Logic
DOI: 10.1017/jsl.2021.6

Algebraic Approach to Promise Constraint Satisfaction

Autori: Barto, Libor; Bulín, Jakub; Krokhin, Andrei; Opršal, Jakub
Pubblicato in: J. ACM, Numero 00045411, 2021, Pagina/e 1-66, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3457606

Higher Kiss terms

Autori: Moorhead, Andrew
Pubblicato in: International Journal of Algebra and Computation, Numero 02181967, 2022, Pagina/e 1233-1259, ISSN 0218-1967
Editore: World Scientific Publishing Co
DOI: 10.1142/s0218196722500539

The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata

Autori: Antoine Mottet, Karin Quaas
Pubblicato in: Theory of Computing Systems, 2020, ISSN 1432-4350
Editore: Springer Verlag
DOI: 10.1007/s00224-020-09997-2

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

Autori: Libor Barto, Michael Pinsker
Pubblicato in: SIAM Journal on Computing, Numero 49/2, 2020, Pagina/e 365-393, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1216213

Accessible set functors are universal

Autori: Barto Libor
Pubblicato in: Commentationes Mathematicae Universitatis Carolinae, Numero 60/4, 2020, Pagina/e 497-508, ISSN 0010-2628
Editore: Mathematical Institute of Charles University
DOI: 10.14712/1213-7243.2019.028

Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps

Autori: Libor Barto
Pubblicato in: Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings, Numero 11651, 2019, Pagina/e 3-17, ISBN 978-3-030-25026-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-25027-0_1

The Containment Problem for Unambiguous Register Automata

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

Pubblicazioni

Condividi questa pagina

Scarica