Homepage of Ondra Ježil
Hi, my name is Ondra and I am a doctoral student at the Department of Algebra of the Faculty of Mathematics and Physics, Charles University, Prague under the supervision of Jan Krajíček. I am interested in Bounded Arithmetic and Computational Complexity Theory.
email: ondrej.jezil[at]email[dot]cz
Research papers
Parallelism and Adaptivity in Student-Teacher Witnessing (with Dimitrios Tsintsilidas) pdf 2026 pre-print, Submitted
Prime Factorization in Models of PV_1 link Logical Methods in Computer Science, April 7, 2026, Volume 22, Issue 2 - https://doi.org/10.46298/lmcs-22(2:1)2026
Feasibility of Primality in Bounded Arithmetic (with Raheleh Jalali) link Forum of Mathematics, Sigma. 2026;14:e49. doi:10.1017/fms.2026.10194
Limits of structures and Total NP Search Problems link Z. Math. Log. Grundlagen Math., to appear (2026), pp. 135–156. DOI: 10.60866/CAM.257.
Teaching (Summer 2024/2025)
Student logic seminar
A seminar about basic propositional proof complexity. Please refer to the seminar's website.