Towards a theory of algorithmic proof complexity (invited talk)

DOI10.4230/LIPICS.ICALP.2022.1MaRDI QIDQ6560784zbMATH OpenFDO

Authors Albert Atserias

Publication date 24 June 2024

zbMATH Keywords

computational complexitylogicproof complexity

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: Towards a theory of algorithmic proof complexity (invited talk)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560784)