Polynomial calculus space and resolution width

DOI10.4086/TOC.2025.V021A006MaRDI QIDQ6860910zbMATH OpenFDO

Authors Nicola Galesi, Leszek Aleksander Kołodziejczyk, Neil Thapen

Publication date 10 February 2026

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

zbMATH Keywords

resolutionproof complexitypolynomial calculus

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

This page was built for publication: Polynomial calculus space and resolution width

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