Location of Repository

Deterministic Approximate Counting of Depth-2 Circuits

By Michael Luby, Boban Velickovic and Avi Wigderson

Abstract

We describe deterministic algorithms which for a given depth-2 circuit F approximate the probability that on a random input F outputs a specific value α. Our approach gives an algorithm which for a given GF[2] multivariate polynomial p and given ε > 0 approximates the number of zeros of p within a multiplicative factor 1+ε. The algorithm runs in time exp(exp(O( p log(n=ffl)))), where n is the size of the circuit. We also obtain an algorithm which given a DNF formula F and ε > 0 approximates the number of satisfying assignments of F within a factor of 1 + ε and runs in time exp(O((log(n/ε))^4))

Year: 1993
OAI identifier: oai:CiteSeerX.psu:10.1.1.36.8813
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.icsi.berkeley.edu/~... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.