Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Toward Super-Polynomial Size Lower Bounds for Depth-Two Threshold Circuits

Published 27 May 2018 in cs.CC | (1805.10698v1)

Abstract: Proving super-polynomial size lower bounds for TC0\textsf{TC}^0, the class of constant-depth, polynomial-size circuits of Majority gates, is a notorious open problem in complexity theory. A major frontier is to prove that NEXP\textsf{NEXP} does not have poly-size THR∘THR\textsf{THR} \circ \textsf{THR} circuit (depth-two circuits with linear threshold gates). In recent years, R.~Williams proposed a program to prove circuit lower bounds via improved algorithms. In this paper, following Williams' framework, we show that the above frontier question can be resolved by devising slightly faster algorithms for several fundamental problems: 1. Shaving Logs for $\textsf{$\ell_2$-Furthest-Pair}$. An n2poly(d)/log⁡ω(1)nn^2 \textrm{poly}(d) / \log^{\omega(1)} n time algorithm for $\textsf{$\ell_2$-Furthest-Pair}$ in Rd\mathbb{R}^d for polylogarithmic dd implies NEXP\textsf{NEXP} has no polynomial size THR∘THR\textsf{THR} \circ \textsf{THR} circuits. The same holds for Hopcroft's problem, $\textsf{Bichrom.-$\ell_2$-Closest-Pair}$ and Integer Max-IP\textsf{Max-IP}. 2. Shaving Logs for Approximate $\textsf{Bichrom.-$\ell_2$-Closest-Pair}$. An n2(d)/log⁡ω(1)nn^2 \textrm(d) / \log^{\omega(1)} n time algorithm for (1+1/log⁡ω(1)n)(1+1/\log^{\omega(1)} n)-approximation to $\textsf{Bichrom.-$\ell_2$-Closest-Pair}$ or $\textsf{Bichrom.-$\ell_1$-Closest-Pair}$ for polylogarithmic dd implies NEXP\textsf{NEXP} has no polynomial size SYM∘THR\textsf{SYM}\circ\textsf{THR} circuits. 3. Shaving Logs for Modest Dimension Boolean Max-IP\textsf{Max-IP}. An n2/log⁡ω(1)nn^2 / \log^{\omega(1)} n time algorithm for Bichromatic Maximum Inner Product with vector dimension d=nϵd = n^\epsilon for any small constant ϵ\epsilon would imply NEXP\textsf{NEXP} has no polynomial size THR∘THR\textsf{THR} \circ \textsf{THR} circuits. Note there is an n2polylog(n)n^2\textrm{polylog}(n) time algorithm via fast rectangle matrix multiplication. Our results build on two structure lemmas for threshold circuits.

Authors (1)
Citations (9)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.