SCIENCE@home

Polynomial Representations of Threshold Functions and Algorithmic Applications

Josh Alman,Timothy M. Chan,Ryan Williams

Published 2016 in IEEE Annual Symposium on Foundations of Computer Science

ABSTRACT

We design new polynomials for representing threshold functions in three different regimes: probabilistic polynomials of low degree, which need far less randomness than previous constructions, polynomial threshold functions (PTFs) with "nice" threshold behavior and degree almost as low as the probabilistic polynomials, and a new notion of probabilistic PTFs where we combine the above techniques to achieve even lower degree with similar "nice" threshold behavior. Utilizing these polynomial constructions, we design faster algorithms for a variety of problems: · Offline Hamming Nearest (and Furthest) Neighbors: Given n red and n blue points in d-dimensional Hamming space for d = c log n, we can find an (exact) nearest (or furthest) blue neighbor for every red point in randomized time n<sup>2-1</sup>/O(√clog<sup>2/3</sup> c) or deterministic time n<sup>2-1/O(c log2 c)</sup>. These improve on a randomized n<sup>2-1/O(c log2 c)</sup> bound by Alman and Williams (FOCS'15), and also lead to faster MAX-SAT algorithms for sparse CNFs. · Offline Approximate Nearest (and Furthest) Neighbors: Given n red and n blue points in d-dimensional ℓ<sub>1</sub> or Euclidean space, we can find a (1+ε)-approximate nearest (or furthest) blue neighbor for each red point in randomized time near dn+n<sup>2-Ω(ε1/3/log(1/ε))</sup>. This improves on an algorithm by Valiant (FOCS'12) with randomized time near dn+n<sup>2-Ω(√ε)</sup>, which in turn improves previous methods based on locality-sensitive hashing. · SAT Algorithms and Lower Bounds for Circuits With Linear Threshold Functions: We give a satisfiability algorithm for AC<sup>0</sup>[m] o LTF LTF circuits with a subquadratic number of LTF gates on the bottom layer, and a subexponential number of gates on the other layers, that runs in deterministic 2<sup>n-n</sup><sup>ε</sup> time. This strictly generalizes a SAT algorithm for ACC<sup>0</sup> oLTF circuits of subexponential size by Williams (STOC'14) and also implies new circuit lower bounds for threshold circuits, improving a recent gate lower bound of Kane and Williams (STOC'16). We also give a randomized 2<sup>n-n</sup><sup>ε</sup>-time SAT algorithm for subexponential-size MAJ o AC<sub>0</sub> oLTF o AC<sub>0</sub> oLTF circuits, where the top MAJ gate and middle LTF gates have O(n<sup>6/5-δ</sup>) fan-in.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-71 of 71 references · Page 1 of 1

CITED BY

Showing 1-89 of 89 citing papers · Page 1 of 1