Algorithmic Polynomials

Sherstov, AA

Sherstov, AA (reprint author), Univ Calif Los Angeles, Los Angeles, CA 90095 USA.

STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018; (): 311

Abstract

The approximate degree of a Boolean function f (x(1), x(2),..., x(n)) is the minimum degree of a real polynomial that approximates f pointwise within ......

Full Text Link