On deterministic approximation of DNF
- 1 October 1996
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 16 (4-5) , 415-433
- https://doi.org/10.1007/bf01940873
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Approximations of general independent distributionsPublished by Association for Computing Machinery (ACM) ,1992
- Approximate Inclusion-ExclusionCombinatorica, 1990
- Small-bias probability spaces: efficient constructions and applicationsPublished by Association for Computing Machinery (ACM) ,1990
- Monte-Carlo approximation algorithms for enumeration problemsJournal of Algorithms, 1989
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- Almost optimal lower bounds for small depth circuitsPublished by Association for Computing Machinery (ACM) ,1986
- ∑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