Research output per year
Research output per year
Personal profile
Research
I am a PhD student in theoretical computer science at Lund University in Sweden under the supervision of Susanna F. de Rezende and Jakob Nordström.
I am broadly interested in computational complexity theory, proof complexity and their interplay with logic. I am also intermittently interested in the philosophy of mathematics and mathematical practice. You can read more about me here.
Fingerprint
Dive into the research topics where Noel Arteche is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Quantum Automating TC0-Frege Is LWE-Hard
Arteche, N., Carenini, G. & Gray, M., 2025 Dec, In: Computational Complexity. 34, 2, 16.Research output: Contribution to journal › Article › peer-review
Open Access -
The Proof Analysis Problem
Arteche, N., Atserias, A., Rezende, S. F. D. & Khaniki, E., 2025, Proceedings - 2025 IEEE 66th Annual Symposium on Foundations of Computer Science, FOCS 2025. IEEE Computer Society, p. 2555-2576 22 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review
-
Towards the exact complexity of realizability for Safety LTL
Arteche, N. & Hermo, M., 2024 Oct, In: Journal of Logical and Algebraic Methods in Programming. 141, 101002.Research output: Contribution to journal › Article › peer-review
Open Access -
From Proof Complexity to Circuit Complexity via Interactive Protocols
Arteche, N., Khaniki, E., Pich, J. & Santhanam, R., 2024 Jul, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review
Open Access -
Quantum Automating TC0-Frege Is LWE-Hard
Arteche, N., Carenini, G. & Gray, M., 2024 Jul, 39th Computational Complexity Conference, CCC 2024. Santhanam, R. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 300).Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review
Open Access