Jakub Opršal
Wagner Group
3 Publications
2024 | Conference Paper | IST-REx-ID: 15168 |
Filakovský, M., Nakajima, T. V., Opršal, J., Tasinato, G., & Wagner, U. (2024). Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In 41st International Symposium on Theoretical Aspects of Computer Science (Vol. 289). Clermont-Ferrand, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2024.34
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Journal Article | IST-REx-ID: 12563 |
Krokhin, A., Opršal, J., Wrochna, M., & Živný, S. (2023). Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/20m1378223
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 11991 |
Krokhin, A., & Opršal, J. (2022). An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. Association for Computing Machinery. https://doi.org/10.1145/3559736.3559740
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
3 Publications
2024 | Conference Paper | IST-REx-ID: 15168 |
Filakovský, M., Nakajima, T. V., Opršal, J., Tasinato, G., & Wagner, U. (2024). Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In 41st International Symposium on Theoretical Aspects of Computer Science (Vol. 289). Clermont-Ferrand, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2024.34
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Journal Article | IST-REx-ID: 12563 |
Krokhin, A., Opršal, J., Wrochna, M., & Živný, S. (2023). Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/20m1378223
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 11991 |
Krokhin, A., & Opršal, J. (2022). An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. Association for Computing Machinery. https://doi.org/10.1145/3559736.3559740
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv