Publications

 

• The Proof Analysis Problem for Constant-Depth Frege
  Noel Arteche, Susanna F. de Rezende, Erfan Khaniki, and Kilian Risse
  Preprint
• The Proof Analysis Problem
  Noel Arteche, Albert Atserias, Susanna F. de Rezende, and Erfan Khaniki
  In the 66th IEEE Symposium on Foundations of Computer Science (FOCS’25)
  [ PDF | arXiv | FOCS extended abstract]
  ↪ Video recording of the FOCS talk
• Quantum Automating TC⁰-Frege Is LWE-Hard
  Noel Arteche, Gaia Carenini, and Matthew Gray
  In Computational Complexity, volume 34, issue 2, article 16 (October 2025)
  Preliminary version in the 39th Computational Complexity Conference (CCC 2024)
  (An earlier version appeared as a poster at QIP 2024)
  [ PDF | ECCC | arXiv | compt. compl. | DROPS | QIP’24 poster ]
• From Proof Complexity to Circuit Complexity via Interactive Protocols
  Noel Arteche, Erfan Khaniki, Ján Pich, and Rahul Santhanam
  In the 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP 2024)
  [ PDF | arXiv | DROPS ]
• Towards the exact complexity of realizability for Safety LTL
  Noel Arteche and Montserrat Hermo
  In the Journal of Logical and Algebraic Methods in Programming, Volume 141 (October 2024)
  [ Journal version ]

Theses

• Parameterized Compilability
  MSc Thesis - 2022
  University of Amsterdam
  [ PDF ] [ Slides from the thesis defense - 11.07.2022 ]
  • My handwritten research notes — Why upload my handwritten notes?
• A Formal Language and Tool for QBF Family Definitions
  BSc Thesis - 2020
  University of the Basque Country / KU Leven
  [ PDF ]