On ϵ-sensitive monotone computations

We show that strong-enough lower bounds on monotone arithmetic circuits or the nonnegative rank of a matrix imply unconditional lower bounds in arithmetic or Boolean circuit complexity. First, we show that if a polynomial f ∈ R [ x 1 , ⋯ , x n ] of degree d has an arithmetic circuit of size s then (...

Ausführliche Beschreibung