Jakub Opršal

Wagner Group

3 Publications

Mark all

[3]
2024 | Conference Paper | IST-REx-ID: 15168 | OA
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2023 | Journal Article | IST-REx-ID: 12563 | OA
Topology and adjunction in promise constraint satisfaction
A. Krokhin, J. Opršal, M. Wrochna, S. Živný, SIAM Journal on Computing 52 (2023) 38–79.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2022 | Journal Article | IST-REx-ID: 11991 | OA
An invitation to the promise constraint satisfaction problem
A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Export / Embed

3 Publications

Mark all

[3]
2024 | Conference Paper | IST-REx-ID: 15168 | OA
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2023 | Journal Article | IST-REx-ID: 12563 | OA
Topology and adjunction in promise constraint satisfaction
A. Krokhin, J. Opršal, M. Wrochna, S. Živný, SIAM Journal on Computing 52 (2023) 38–79.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2022 | Journal Article | IST-REx-ID: 11991 | OA
An invitation to the promise constraint satisfaction problem
A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Export / Embed