Strongly Exponential Separation Between Monotone VP and Monotone VNP

03/05/2019
by   Srikanth Srinivasan, et al.
0

We show that there is a sequence of explicit multilinear polynomials P_n(x_1,...,x_n)∈R[x_1,...,x_n] with non-negative coefficients that lies in monotone VNP such that any monotone algebraic circuit for P_n must have size (Ω(n)). This builds on (and strengthens) a result of Yehudayoff (2018) who showed a lower bound of (Ω̃(√(n))).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/26/2022

Transparency Beyond VNP in the Monotone Setting

Recently Hrubes and Yehudayoff (2021) showed a connection between the mo...
research
07/12/2022

Size and depth of monotone neural networks: interpolation and approximation

Monotone functions and data sets arise in a variety of applications. We ...
research
09/14/2021

Monotone Complexity of Spanning Tree Polynomial Re-visited

We prove two results that shed new light on the monotone complexity of t...
research
01/07/2020

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity

We significantly strengthen and generalize the theorem lifting Nullstell...
research
12/15/2020

Stochastic monotonicity and the Markov product for copulas

Given two random variables X and Y, stochastic monotonicity describes a ...
research
11/25/2019

Making Learners (More) Monotone

Learning performance can show non-monotonic behavior. That is, more data...
research
02/18/2020

Probabilistically Faulty Searching on a Half-Line

We study p-Faulty Search, a variant of the classic cow-path optimization...

Please sign up or login with your details

Forgot password? Click here to reset