Jakub Oprsal

According to our database, Jakub Oprsal authored at least 22 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Functors on Relational Structures Which Admit Both Left and Right Adjoints.

Víctor Dalmau, Andrei A. Krokhin, Jakub Oprsal

SIAM J. Discret. Math., 2024

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

Sebastian Meyer, Jakub Oprsal

CoRR, 2024

Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.

Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Local consistency as a reduction between constraint satisfaction problems.

Víctor Dalmau, Jakub Oprsal

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Right-Adjoints for Datalog Programs.

Balder ten Cate, Víctor Dalmau, Jakub Oprsal

Proceedings of the 27th International Conference on Database Theory, 2024

2023

Topology and Adjunction in Promise Constraint Satisfaction.

Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný

SIAM J. Comput., February, 2023

Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes.

Balder ten Cate, Víctor Dalmau, Jakub Oprsal

CoRR, 2023

2022

An Invitation to the Promise Constraint Satisfaction Problem.

Andrei A. Krokhin, Jakub Oprsal

Electron. Colloquium Comput. Complex., 2022

2021

Algebraic Approach to Promise Constraint Satisfaction.

Libor Barto, Jakub Bulín, Andrei A. Krokhin, Jakub Oprsal

J. ACM, 2021

2020

ω-categorical structures avoiding height 1 identities.

Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard

CoRR, 2020

2019

Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs.

Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal

SIAM J. Comput., 2019

The complexity of 3-colouring <i>H</i>-colourable graphs.

Andrei A. Krokhin, Jakub Oprsal

Electron. Colloquium Comput. Complex., 2019

Revisiting Alphabet Reduction in Dinur's PCP.

Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep

Electron. Colloquium Comput. Complex., 2019

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

Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard

CoRR, 2019

Deciding the existence of minority terms.

Alexandr Kazda, Jakub Oprsal, Matt Valeriote, Dmitriy Zhuk

CoRR, 2019

Algebraic approach to promise constraint satisfaction.

Jakub Bulín, Andrei A. Krokhin, Jakub Oprsal

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

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

Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

The Complexity of 3-Colouring H-Colourable Graphs.

Andrei A. Krokhin, Jakub Oprsal

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Taylor's Modularity Conjecture and Related Problems for Idempotent Varieties.

Jakub Oprsal

Order, 2018

Complexity of term representations of finitary functions.

Erhard Aichinger, Nebojsa Mudrinski, Jakub Oprsal

Int. J. Algebra Comput., 2018

2015

The wonderland of reflections.

Libor Barto, Jakub Oprsal, Michael Pinsker

CoRR, 2015

2014

Universal Lyndon Words.

Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014