Weighted Gate Elimination: Boolean Dispersers for Quadratic Varieties Imply Improved Circuit Lower Bounds

In this paper we motivate the study of Boolean dispersers for quadratic varieties by showing that an explicit construction of such objects gives improved circuit lower bounds. An (n, k, s)quadratic disperser is a function on n variables that is not constant on any subset of Fn 2 of size at least s that can be defined as the set of common roots of at most k quadratic polynomials.

• Type: Journal
• Year: 2016
• Where: INNOVATIONS
• Authors: Alexander Golovnev, Alexander S. Kulikov
• Keywords: INNOVATIONS 2016