Jakub Opršal
Titolo
Citata da
Citata da
Anno
The wonderland of reflections
L Barto, J Opršal, M Pinsker
Israel Journal of Mathematics 223 (1), 363-398, 2018
732018
Algebraic approach to promise constraint satisfaction
J Bulín, A Krokhin, J Opršal
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
36*2019
Taylor’s modularity conjecture and related problems for idempotent varieties
J Opršal
Order 35 (3), 433-460, 2018
122018
Robust algorithms with polynomial loss for near-unanimity CSPs
V Dalmau, M Kozik, A Krokhin, K Makarychev, Y Makarychev, J Opršal
SIAM Journal on Computing 48 (6), 1763-1795, 2019
112019
A relational description of higher commutators in Mal’cev varieties
J Opršal
Algebra universalis 76 (3), 367-383, 2016
112016
The complexity of 3-colouring H-colourable graphs
A Krokhin, J Opršal
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
82019
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)
M Bodirsky, A Mottet, M Olšák, J Opršal, M Pinsker, R Willard
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2019
8*2019
Complexity of term representations of finitary functions
E Aichinger, N Mudrinski, J Opršal
International Journal of Algebra and Computation 28 (06), 1101-1118, 2018
72018
Distributive and anti-distributive Mendelsohn triple systems
DM Donovan, TS Griggs, TA McCourt, J Opršal, D Stanovský
Canadian Mathematical Bulletin 59 (1), 36-49, 2016
72016
Deciding the existence of minority terms
A Kazda, J Opršal, M Valeriote, D Zhuk
Canadian Mathematical Bulletin 63 (3), 577-591, 2020
32020
ω-categorical structures avoiding height 1 identities
M Bodirsky, A Mottet, M Olšák, J Opršal, M Pinsker, R Willard
arXiv preprint arXiv:2006.12254, 2020
1*2020
Topology and adjunction in promise constraint satisfaction
A Krokhin, J Opršal, M Wrochna, S Živný
arXiv preprint arXiv:2003.11351, 2020
12020
Universal Lyndon Words
A Carpi, G Fici, Š Holub, J Opršal, M Sciortino
International Symposium on Mathematical Foundations of Computer Science, 135-146, 2014
12014
Revisiting alphabet reduction in Dinur’s PCP
V Guruswami, J Opršal, S Sandeep
Schloss Dagstuhl, 2020
2020
Il sistema al momento non puň eseguire l'operazione. Riprova piů tardi.
Articoli 1–14