DNF sparsification and a faster deterministic counting algorithm
- 7 May 2013
- journal article
- research article
- Published by Springer Nature in computational complexity
- Vol. 22 (2) , 275-310
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- A Simple Proof of Bazzi’s TheoremACM Transactions on Computation Theory, 2009
- On deterministic approximation of DNFAlgorithmica, 1996
- Hardness vs randomnessJournal of Computer and System Sciences, 1994
- Constant depth circuits, Fourier transform, and learnabilityJournal of the ACM, 1993
- Pseudorandom bits for constant depth circuitsCombinatorica, 1991
- Monte-Carlo approximation algorithms for enumeration problemsJournal of Algorithms, 1989
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Intersection Theorems for Systems of SetsJournal of the London Mathematical Society, 1960