## Abstract

We give a deterministic algorithm for approximately counting satisfying assignments of a degree-d polynomial threshold function (PTF). Given a degree-d input polynomial p(x) over ℝ^{n} and a parameter ε > 0, our algorithm approximates Pr_{x∼{-1,1}}^{n}[p(x) ≥ 0] to within an additive ±ε in time O_{d,ε}(1) · poly(n^{d}). (Since it is NP-hard to determine whether the above probability is nonzero, any sort of efficient multiplicative approximation is almost certainly impossible even for randomized algorithms.) Note that the running time of our algorithm (as a function of n^{d}, the number of coefficients of a degree-d PTF) is a fixed polynomial. The fastest previous algorithm for this problem [Kan12b], based on constructions of unconditional pseudorandom generators for degree-d PTFs, runs in time n^{O} _{d,c}^{(1)}_{ε}^{-c} for all c < 0. The key novel technical contributions of this work are • A new multivariate central limit theorem, proved using tools from Malliavin calculus and Stein's Method. This new CLT shows that any collection of Gaussian polynomials with small eigenvalues must have a joint distribution which is very close to a multidimensional Gaussian distribution. • A new decomposition of low-degree multilinear polynomials over Gaussian inputs. Roughly speaking we show that (up to some small error) any such polynomial can be decomposed into a bounded number of multilinear polynomials all of which have extremely small eigenvalues. We use these new ingredients to give a deterministic algorithm for a Gaussian-space version of the approximate counting problem, and then employ standard techniques for working with low-degree PTFs (invariance principles and regularity lemmas) to reduce the original approximate counting problem over the Boolean hypercube to the Gaussian version. As an application of our result, we give the first deterministic fixed-parameter tractable algorithm for the following moment approximation problem: given a degree-d polynomial p(x _{1},. ., x_{n}) over {-1, 1}^{n}, a positive integer κ and an error parameter ε, output a (1±ε)- multiplicatively accurate estimate to E_{x∼{-1,1}} ^{n}[|p(x)|^{κ}]. Our algorithm runs in time O _{d,ε,κ} (1) · poly(n^{d}).

Original language | English (US) |
---|---|

Title of host publication | STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing |

Publisher | Association for Computing Machinery |

Pages | 832-841 |

Number of pages | 10 |

ISBN (Print) | 9781450327107 |

DOIs | |

State | Published - 2014 |

Event | 4th Annual ACM Symposium on Theory of Computing, STOC 2014 - New York, NY, United States Duration: May 31 2014 → Jun 3 2014 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|

ISSN (Print) | 0737-8017 |

### Other

Other | 4th Annual ACM Symposium on Theory of Computing, STOC 2014 |
---|---|

Country | United States |

City | New York, NY |

Period | 5/31/14 → 6/3/14 |

## Keywords

- Approximate counting
- Derandomization
- Polynomial threshold function

## ASJC Scopus subject areas

- Software