Approximating the number of zeroes of a GF[2] polynomial

Authors:
Marek Karpinski;Michael Luby
Affiliations:
Department of Computer Science, University of Bonn and International Computer Science Institute, Berkeley, California;International Computer Science Institute, Berkeley, California
Venue:
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Year:
1991

Citing 3
Cited 0

Recognizing primes in random polynomial time

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Monte-Carlo approximation algorithms for enumeration problems

Journal of Algorithms
On deterministic approximation of DNF

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract