The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
This paper gives nearly optimal, logarithmic upper and lower bounds on the minimum degree of Nullstellensatz refutations (i.e., polynomials) of the propositional induction princip...