Symmetry in Computational Complexity

Weisfeiler-Leman Invariant Promise Valued CSPs

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

The complete classification for quantified equality constraints

Autorzy: Dmitriy Zhuk, Barnaby Martin, Michal Wrona
Opublikowane w: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Numer 1, 2023, Strona(/y) 2746-2760, ISBN 978-1-61197-755-4
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch103

Hrushovski’s Encoding and ω-Categorical CSP Monsters

Autorzy: Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker
Opublikowane w: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Numer 1/year, 2020, Strona(/y) 131:1--131:17, ISBN 978-3-95977-138-2
Wydawca: "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

Autorzy: Libor Barto; Zarathustra Brady; Andrei A. Bulatov; Marcin Kozik; Dmitriy Zhuk
Opublikowane w: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Strona(/y) 1-13
Wydawca: IEEE Computer Society
DOI: 10.1109/lics52264.2021.9470557

Combinatorial Gap Theorem and Reductions between Promise CSPs

Autorzy: Barto, Libor; Kozik, Marcin
Opublikowane w: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Strona(/y) 1204-1220, ISBN 978-1-61197-707-3
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977073.50

Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case

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

Fixed-Template Promise Model Checking Problems

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

Sensitive instances of the Constraint Satisfaction Problem

Autorzy: Barto, Libor; Kozik, Marcin; Tan, Johnson; Valeriote, Matt
Opublikowane w: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Numer 1/year, 2020, Strona(/y) 110:1--110:18, ISBN 978-3-95977-138-2
Wydawca: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.icalp.2020.110

Finitely Tractable Promise Constraint Satisfaction Problems

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

Smooth Approximations and Relational Width Collapses

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

Promises Make Finite (Constraint Satisfaction) Problems Infinitary

Autorzy: Libor Barto
Opublikowane w: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, Strona(/y) 1-8, ISBN 978-1-7281-3608-0
Wydawca: IEEE
DOI: 10.1109/lics.2019.8785671

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

Autorzy: Manuel Bodirsky, Antoine Mottet, Miroslav Olsak, Jakub Oprsal, Michael Pinsker, Ross Willard
Opublikowane w: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, Strona(/y) 1-12, ISBN 978-1-7281-3608-0
Wydawca: IEEE
DOI: 10.1109/lics.2019.8785883

enNew Techniques for Universality in Unambiguous Register Automata

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

QCSP monsters and the demise of the chen conjecture

Autorzy: Dmitriy Zhuk, Barnaby Martin
Opublikowane w: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, Numer 1/year, 2020, Strona(/y) 91-104, ISBN 9781450369794
Wydawca: ACM
DOI: 10.1145/3357713.3384232

Smooth approximations and CSPs over finitely bounded homogeneous structures

Autorzy: Mottet, Antoine; Pinsker, Michael
Opublikowane w: LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, 2022, Strona(/y) 1-13, ISBN 978-1-4503-9351-5
Wydawca: Association for Computing Machinery
DOI: 10.1145/3531130.3533353

Constraint satisfaction problems over finite structures

Autorzy: Libor Barto; William DeMeo; Antoine Mottet
Opublikowane w: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Strona(/y) 1-13
Wydawca: IEEE Computer Society
DOI: 10.1109/lics52264.2021.9470670

QCSP monsters and the demise of the chen conjecture

Autorzy: Dmitriy Zhuk; Barnaby Martin
Opublikowane w: Journal of the ACM, Numer 69/5, 2022, Strona(/y) 1-44, ISSN 0004-5411
Wydawca: Association for Computing Machinary, Inc.
DOI: 10.1145/3563820

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

Autorzy: Pierre Gillibert; Julius Jonušas; Michael Kompatscher; Antoine Mottet; Michael Pinsker
Opublikowane w: SIAM Journal on Computing, Numer 00975397, 2022, Strona(/y) 175-213, ISSN 0097-5397
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1383471

$\omega $-categorical structures avoiding height 1 identities

Autorzy: Manuel Bodirsky, Antoine Mottet, Miroslav Olšák, Jakub Opršal, Michael Pinsker, Ross Willard
Opublikowane w: Transactions of the American Mathematical Society, Numer 374/1, 2021, Strona(/y) 327-350, ISSN 0002-9947
Wydawca: American Mathematical Society
DOI: 10.1090/tran/8179

A Proof of the CSP Dichotomy Conjecture

Autorzy: Dmitriy Zhuk
Opublikowane w: Journal of the ACM, Numer 67/5, 2020, Strona(/y) 1-78, ISSN 0004-5411
Wydawca: Association for Computing Machinary, Inc.
DOI: 10.1145/3402029

A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP

Autorzy: Manuel Bodirsky; Florent Madelaine; Antoine Mottet
Opublikowane w: SIAM Journal on Computing, Numer 00975397, 2021, Strona(/y) 1359-1409, ISSN 0097-5397
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m128466x

CORES OVER RAMSEY STRUCTURES

Autorzy: Antoine Mottet; Michael Pinsker
Opublikowane w: The Journal of Symbolic Logic, Numer 00224812, 2021, Strona(/y) 352–361, ISSN 0022-4812
Wydawca: Association for Symbolic Logic
DOI: 10.1017/jsl.2021.6

Algebraic Approach to Promise Constraint Satisfaction

Autorzy: Barto, Libor; Bulín, Jakub; Krokhin, Andrei; Opršal, Jakub
Opublikowane w: J. ACM, Numer 00045411, 2021, Strona(/y) 1-66, ISSN 0004-5411
Wydawca: Association for Computing Machinary, Inc.
DOI: 10.1145/3457606

Higher Kiss terms

Autorzy: Moorhead, Andrew
Opublikowane w: International Journal of Algebra and Computation, Numer 02181967, 2022, Strona(/y) 1233-1259, ISSN 0218-1967
Wydawca: World Scientific Publishing Co
DOI: 10.1142/s0218196722500539

The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata

Autorzy: Antoine Mottet, Karin Quaas
Opublikowane w: Theory of Computing Systems, 2020, ISSN 1432-4350
Wydawca: Springer Verlag
DOI: 10.1007/s00224-020-09997-2

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

Autorzy: Libor Barto, Michael Pinsker
Opublikowane w: SIAM Journal on Computing, Numer 49/2, 2020, Strona(/y) 365-393, ISSN 0097-5397
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1216213

Accessible set functors are universal

Autorzy: Barto Libor
Opublikowane w: Commentationes Mathematicae Universitatis Carolinae, Numer 60/4, 2020, Strona(/y) 497-508, ISSN 0010-2628
Wydawca: Mathematical Institute of Charles University
DOI: 10.14712/1213-7243.2019.028

Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps

Autorzy: Libor Barto
Opublikowane w: Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings, Numer 11651, 2019, Strona(/y) 3-17, ISBN 978-3-030-25026-3
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-030-25027-0_1

The Containment Problem for Unambiguous Register Automata

Autorzy: Mottet, Antoine; Quaas, Karin
Opublikowane w: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 2019, Strona(/y) 53:1--53:15, ISBN 978-3-95977-100-9
Wydawca: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2019.53

Publikacje

Udostępnij tę stronę

Pobierz