Follow
Ian Mertz
Ian Mertz
Postdoctoral Researcher, Charles University
Verified email at iuuk.mff.cuni.cz - Homepage
Title
Cited by
Cited by
Year
Automating cutting planes is NP-hard
M Göös, S Koroth, I Mertz, T Pitassi
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
352020
Lifting with sunflowers
S Lovett, R Meka, I Mertz, T Pitassi, J Zhang
Leibniz international proceedings in informatics 215, 2022
322022
Complexity of regular functions
E Allender, I Mertz
Journal of Computer and System Sciences 104, 5-16, 2019
192019
Catalytic approaches to the tree evaluation problem
J Cook, I Mertz
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
152020
Short proofs are hard to find
I Mertz, T Pitassi, Y Wei
46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
132019
Tree Evaluation Is in Space 𝑂 (log 𝑛· log log 𝑛)
J Cook, I Mertz
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1268-1278, 2024
92024
Reusing space: Techniques and open problems
I Mertz
Bulletin of EATCS 141 (3), 2023
92023
Encodings and the tree evaluation problem
J Cook, I Mertz
Electron. Colloquium Comput. Complex 54, 2021
92021
Trading time and space in catalytic branching programs
J Cook, I Mertz
37th Computational Complexity Conference (CCC 2022), 8: 1-8: 21, 2022
82022
Dual VP classes
E Allender, A Gál, I Mertz
computational complexity 26, 583-625, 2017
82017
The structure of catalytic space: Capturing randomness and time via compression
J Cook, J Li, I Mertz, E Pyne
Electronic Colloquium on Computational Complexity (ECCC), TR24-106, 2024
62024
Collapsing Catalytic Classes
M Koucký, E Pyne, I Mertz, S Sami
2025
Fully Characterizing Lossy Catalytic Computation
M Folkertsma, I Mertz, F Speelman, Q Tupker
arXiv preprint arXiv:2409.05046, 2024
2024
LIPIcs, Volume 234, CCC 2022, Complete Volume}}
S Lovett, G Beniamini, T Tantau, A Bogdanov, WM Hoza, G Prakriya, ...
37th Computational Complexity Conference (CCC 2022) 234, 9, 2022
2022
The Complexity of Composition: New Approaches to Depth and Space
I Mertz
University of Toronto (Canada), 2022
2022
The system can't perform the operation now. Try again later.
Articles 1–15