Abstract
Polynomial complexity is an algebraic proof system inspired by Gröbner bases which was introduced by Clegg, Edmonds and Impagliazzo. Alekhnovich and Razborov devised a method for proving degree lower bounds for polynomial calculus. We present an alternative account of their method, which also encompasses a generalization due to Galesi and Lauria.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
