New relations and separations of conjectures about incompleteness in the finite domain E Khaniki The Journal of Symbolic Logic 87 (3), 912-937, 2022 | 10 | 2022 |
New relations and separations of conjectures about incompleteness in the finite domain. arXiv e-prints E Khaniki arXiv preprint arXiv:1904.01362, 1-25, 2019 | 8 | 2019 |
On proof complexity of resolution over polynomial calculus E Khaniki ACM Transactions on Computational Logic (TOCL) 23 (3), 1-24, 2022 | 5 | 2022 |
Nisan-Wigderson generators in proof complexity: new lower bounds E Khaniki 37th Computational Complexity Conference (CCC 2022), 2022 | 5 | 2022 |
TFNP Intersections Through the Lens of Feasible Disjunction P Hubáček, E Khaniki, N Thapen 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), 2024 | 4 | 2024 |
From Proof Complexity to Circuit Complexity via Interactive Protocols N Arteche, E Khaniki, J Pich, R Santhanam arXiv preprint arXiv:2405.02232, 2024 | 3 | 2024 |
A Counterexample to Polynomially Bounded Realizability of Basic Arithmetic M Ardeshir, E Khaniki, M Shahriari Notre Dame Journal of Formal Logic 60 (3), 481-489, 2019 | 2 | 2019 |
The provably total recursive functions and the MRDP theorem in Basic Arithmetic and its extensions M Ardeshir, E Khaniki, M Shahriari arXiv preprint arXiv:2003.01603, 2020 | 1 | 2020 |
Jump Operators, Interactive Proofs and Proof Complexity Generators E Khaniki 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024 | | 2024 |
The provably total functions of basic arithmetic and its extensions M Ardeshir, E Khaniki, M Shahriari Archive for Mathematical Logic, 1-53, 2024 | | 2024 |
(Im)possibilty results in Proof Complexity and Arithmetic E Khaniki Univerzita Karlova, Matematicko-fyzikální fakulta, 2023 | | 2023 |
Not all Kripke models of HA are locally PA E Khaniki Advances in Mathematics 397, 108126, 2022 | | 2022 |