On the Probabilistic Degree of an n-variate Boolean Function

07/07/2021
by   Srikanth Srinivasan, et al.
0

Nisan and Szegedy (CC 1994) showed that any Boolean function f:{0,1}^n→{0,1} that depends on all its input variables, when represented as a real-valued multivariate polynomial P(x_1,…,x_n), has degree at least log n - O(loglog n). This was improved to a tight (log n - O(1)) bound by Chiarelli, Hatami and Saks (Combinatorica 2020). Similar statements are also known for other Boolean function complexity measures such as Sensitivity (Simon (FCT 1983)), Quantum query complexity, and Approximate degree (Ambainis and de Wolf (CC 2014)). In this paper, we address this question for Probabilistic degree. The function f has probabilistic degree at most d if there is a random real-valued polynomial of degree at most d that agrees with f at each input with high probability. Our understanding of this complexity measure is significantly weaker than those above: for instance, we do not even know the probabilistic degree of the OR function, the best-known bounds put it between (log n)^1/2-o(1) and O(log n) (Beigel, Reingold, Spielman (STOC 1991); Tarui (TCS 1993); Harsha, Srinivasan (RSA 2019)). Here we can give a near-optimal understanding of the probabilistic degree of n-variate functions f, modulo our lack of understanding of the probabilistic degree of OR. We show that if the probabilistic degree of OR is (log n)^c, then the minimum possible probabilistic degree of such an f is at least (log n)^c/(c+1)-o(1), and we show this is tight up to (log n)^o(1) factors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/23/2020

Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem

Based on the recent breakthrough of Huang (2019), we show that for any t...
research
06/02/2019

Approximate degree, secret sharing, and concentration phenomena

The ϵ-approximate degree deg_ϵ(f) of a Boolean function f is the least d...
research
03/25/2021

Random restrictions and PRGs for PTFs in Gaussian Space

A polynomial threshold function (PTF) f:ℝ^n →ℝ is a function of the form...
research
06/06/2023

Computing all monomials of degree n-1 using 2n-3 AND gates

We consider the vector-valued Boolean function f:{0,1}^n→{0,1}^n that ou...
research
07/02/2019

Learning from satisfying assignments under continuous distributions

What kinds of functions are learnable from their satisfying assignments?...
research
01/25/2018

Tight Bound on the Number of Relevant Variables in a Bounded degree Boolean function

In this paper, we prove that a degree d Boolean function depends on at m...
research
10/11/2017

Concentration of Multilinear Functions of the Ising Model with Applications to Network Data

We prove near-tight concentration of measure for polynomial functions of...

Please sign up or login with your details

Forgot password? Click here to reset