Noel Arteche

According to our database, Noel Arteche authored at least 6 papers between 2024 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Quantum Automating TC⁰-Frege Is LWE-Hard.

Noel Arteche, Gaia Carenini, Matthew Gray

Comput. Complex., December, 2025

The Proof Analysis Problem.

Noel Arteche, Albert Atserias, Susanna F. de Rezende, Erfan Khaniki

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024

Towards the exact complexity of realizability for Safety LTL.

Noel Arteche, Montserrat Hermo

J. Log. Algebraic Methods Program., 2024

Quantum Automating $\mathbf{TC}^0$-Frege Is LWE-Hard.

Noel Arteche, Gaia Carenini, Matthew Gray

Electron. Colloquium Comput. Complex., 2024

From Proof Complexity to Circuit Complexity via Interactive Protocols.

Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Quantum Automating TC⁰-Frege Is LWE-Hard.

Noel Arteche, Gaia Carenini, Matthew Gray

Proceedings of the 39th Computational Complexity Conference, 2024