Verifying proofs in constant depth

DOI10.1145/2462896.2462898zbMath1322.68081DBLPjournals/toct/BeyersdorffDKMSSTV13OpenAlexW2106155109WikidataQ59901839 ScholiaQ59901839MaRDI QIDQ2947574

No author found.

Publication date: 24 September 2015

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/79314/8/JournalRevision.pdf

zbMATH Keywords

circuit complexityproof complexityproof circuitssmall depth proofs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)

Related Items (1)

A Circuit Complexity Approach to Transductions

This page was built for publication: Verifying proofs in constant depth