# PublicationsPapers

## Another look at degree lower bounds for polynomial calculus

Yuval Filmus
Theoretical Computer Science

Alekhnovich and Razborov (Lower bounds for polynomial calculus: non-binomial case) gave a sophisticated degree lower bound for proofs in the polynomial calculus proof system. However, their proof is somewhat opaque. We present a different, more intuitive proof. We also adapt our proof to obtain related results of Galesi and Lauria.

Work done while visiting KTH in December 2012.

## BibTeX

@article{Filmus2019,
author = {Yuval Filmus},
title = {Another look at degree lower bounds for polynomial calculus},
journal = {Theoretical Computer Science},
volume = {796},
pages = {286--293},
year = {2019}
}
copy to clipboard