A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Short Proofs for the Determinant Identities

2015
*
SIAM journal on computing (Print)
*

We study arithmetic proof systems P c (F) and P f (F) operating with arithmetic circuits and arithmetic formulas, respectively, and that prove polynomial identities over a field F. We establish a series of structural theorems about these proof systems, the main one stating that P c (F) proofs can be balanced: if a polynomial identity of syntactic degree d and depth k has a P c (F) proof of size s, then it also has a P c (F) proof of size poly(s, d) in which every circuit has depth O(k + log 2 d

doi:10.1137/130917788
fatcat:q6qgppfiv5agtkcg2iuazpwmre