Quantum Automating TC⁰-Frege Is LWE-Hard. - Noel Arteche; Gaia Carenini; Matthew Gray (CCC, 2024)

From Proof Complexity to Circuit Complexity via Interactive Protocols. - Noel Arteche; Erfan Khaniki; Ján Pich; Rahul Santhanam (ICALP, 2024)

Quantum Automating TC0-Frege Is LWE-Hard. - Noel Arteche; Gaia Carenini; Matthew Gray (CoRR, 2024)

Quantum Automating $ mathbf{TC}^0$-Frege Is LWE-Hard. - Noel Arteche; Gaia Carenini; Matthew Gray (Electron. Colloquium Comput. Complex., 2024)

Towards the exact complexity of realizability for Safety LTL. - Noel Arteche; Montserrat Hermo (J. Log. Algebraic Methods Program., 2024)

The Proof Analysis Problem. - Noel Arteche; Albert Atserias; Susanna F. de Rezende; Erfan Khaniki (CoRR, 2025)