On the complexity of finding narrow proofs

DOI10.1109/FOCS.2012.48MaRDI QIDQ6988212zbMATH OpenFDO

Authors Christoph Berkholz

Publication date 5 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2012.48

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(1)

• Supercritical size-width tree-like resolution trade-offs for graph isomorphism

This page was built for publication: On the complexity of finding narrow proofs

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