Noel Arteche

202420254 2

Public access

0 articles

1 article

available

not available

Based on funding mandates

Erfan KhanikiInstitute of Mathematics of the Czech Academy of SciencesVerified email at math.cas.cz
Montserrat HermoUniversity of the Basque CountryVerified email at ehu.eus
Gaia CareniniPhD at University of CambridgeVerified email at cam.ac.uk

Noel Arteche

PhD student, Lund University & University of Copenhagen

Verified email at cs.lth.se - Homepage


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
From proof complexity to circuit complexity via interactive protocols N Arteche, E Khaniki, J Pich, R Santhanam arXiv preprint arXiv:2405.02232, 2024	4	2024
Quantum Automating -Frege Is LWE-Hard N Arteche, G Carenini, M Gray arXiv preprint arXiv:2402.10351, 2024	2	2024
Towards the exact complexity of realizability for Safety LTL N Arteche, M Hermo Journal of Logical and Algebraic Methods in Programming 141, 101002, 2024	1	2024
Parameterized Compilability N ARTECHE Institute for Logic, 2022		2022
Wittgenstein’s Aesthetics in the Philosophy of Mathematical Practice N Arteche		2022
Between Invention and Discovery: What Video Game Speedrunning Can Teach Us about Mathematical Practice N Arteche		2022
Strict Finitism's Unrequited Love for Computational Complexity N Arteche		2021
Prime Implicant Enumeration via QBF Solvers N Arteche, M Hermo
A Formal Language for QBF Family Definitions NA Echeverrıa, M van der Hallen

The system can't perform the operation now. Try again later.

Articles 1–9

Citations per year