Jakub Oprsal

According to our database1, Jakub Oprsal authored at least 13 papers between 2014 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Topology and adjunction in promise constraint satisfaction.
Electron. Colloquium Comput. Complex., 2020

ω-categorical structures avoiding height 1 identities.
CoRR, 2020

2019
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs.
SIAM J. Comput., 2019

The complexity of 3-colouring $H$-colourable graphs.
Electron. Colloquium Comput. Complex., 2019

Revisiting Alphabet Reduction in Dinur's PCP.
Electron. Colloquium Comput. Complex., 2019

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

Deciding the existence of minority terms.
CoRR, 2019

Algebraic approach to promise constraint satisfaction.
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).
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

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

Complexity of term representations of finitary functions.
Int. J. Algebra Comput., 2018

2015
The wonderland of reflections.
CoRR, 2015

2014
Universal Lyndon Words.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014


  Loading...