Jakub Oprsal

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 31

Top Topics

Linearly Ordered

Datalog Programs

Tractable Subclasses

Constraint Satisfaction

Top Venues

Electron. Colloquium Comput. Complex.

SIAM J. Comput.

Publications

Víctor Dalmau, Jakub Oprsal
Local consistency as a reduction between constraint satisfaction problems. LICS (2024)
Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner
Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. STACS (2024)
Víctor Dalmau, Andrei A. Krokhin, Jakub Oprsal
Functors on Relational Structures Which Admit Both Left and Right Adjoints. SIAM J. Discret. Math. 38 (3) (2024)
Balder ten Cate, Víctor Dalmau, Jakub Oprsal
Right-Adjoints for Datalog Programs. ICDT (2024)
Víctor Dalmau, Andrei A. Krokhin, Jakub Oprsal
Functors on relational structures which admit both left and right adjoints. CoRR (2023)
Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný
Topology and Adjunction in Promise Constraint Satisfaction. SIAM J. Comput. 52 (1) (2023)
Victor Dalmau, Jakub Oprsal
Local consistency as a reduction between constraint satisfaction problems. CoRR (2023)
Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. CoRR (2023)
Balder ten Cate, Víctor Dalmau, Jakub Oprsal
Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes. CoRR (2023)
Andrei A. Krokhin, Jakub Oprsal
An Invitation to the Promise Constraint Satisfaction Problem. Electron. Colloquium Comput. Complex. (2022)
Andrei A. Krokhin, Jakub Oprsal
An invitation to the promise constraint satisfaction problem. CoRR (2022)
Andrei A. Krokhin, Jakub Oprsal
An invitation to the promise constraint satisfaction problem. ACM SIGLOG News 9 (3) (2022)
Libor Barto, Jakub Bulín, Andrei A. Krokhin, Jakub Oprsal
Algebraic Approach to Promise Constraint Satisfaction. J. ACM 68 (4) (2021)
Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný
Topology and adjunction in promise constraint satisfaction. Electron. Colloquium Comput. Complex. 27 (2020)
Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný
Topology and adjunction in promise constraint satisfaction. CoRR (2020)
Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep
Revisiting Alphabet Reduction in Dinur's PCP. APPROX-RANDOM (2020)
Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
ω-categorical structures avoiding height 1 identities. CoRR (2020)
Alexandr Kazda, Jakub Oprsal, Matt Valeriote, Dmitriy Zhuk
Deciding the existence of minority terms. CoRR (2019)
Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). LICS (2019)
Jakub Bulín, Andrei A. Krokhin, Jakub Oprsal
Algebraic approach to promise constraint satisfaction. STOC (2019)
Andrei A. Krokhin, Jakub Oprsal
The Complexity of 3-Colouring H-Colourable Graphs. FOCS (2019)
Andrei A. Krokhin, Jakub Oprsal
The complexity of 3-colouring H-colourable graphs. CoRR (2019)
Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep
Revisiting Alphabet Reduction in Dinur's PCP. Electron. Colloquium Comput. Complex. 26 (2019)
Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs. SIAM J. Comput. 48 (6) (2019)
Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems). CoRR (2019)
Andrei A. Krokhin, Jakub Oprsal
The complexity of 3-colouring $H$-colourable graphs. Electron. Colloquium Comput. Complex. 26 (2019)
Jakub Oprsal
Taylor's Modularity Conjecture and Related Problems for Idempotent Varieties. Order 35 (3) (2018)
Erhard Aichinger, Nebojsa Mudrinski, Jakub Oprsal
Complexity of term representations of finitary functions. Int. J. Algebra Comput. 28 (6) (2018)
Jakub Bulín, Andrei A. Krokhin, Jakub Oprsal
Algebraic approach to promise constraint satisfaction. CoRR (2018)
Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
Robust algorithms with polynomial loss for near-unanimity CSPs. SODA (2017)
Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
Robust algorithms with polynomial loss for near-unanimity CSPs. CoRR (2016)
Libor Barto, Jakub Oprsal, Michael Pinsker
The wonderland of reflections. CoRR (2015)
Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino
Universal Lyndon Words. CoRR (2014)
Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino
Universal Lyndon Words. MFCS (1) (2014)