This is a preview of subscription content, log in via an institution to check access.
References
Ehrenfeucht, A., Karpinski, M., The Computational Complexity of (XOR, AND)-Counting Problems, Technical Report TR-90-031, International Computer Science Institute, Berkeley, 1990.
Grigoriev, D., Karpinski, M., An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q], Technical Report TR-91-027, International Computer Science Institute, Berkeley, 1991.
Karp, R., Luby, M., Monte-Carlo Algorithms for Enumeration and Reliability Problems, 24th STOC, November 7–9, 1983, pp. 54–63.
Karp, R., Luby, M., Madras, N., Monte-Carlo Approximation Algorithms for Enumeration Problems, J. of Algorithms, 10, No. 3, Sept. 1989, pp. 429–448.
Karpinski, M., Boolean Circuit Complexity of Algebraic Interpolation Problems, Proc. CSL '88 Lecture Notes in Computer Science, 385 (1989), pp. 138–147.
Karpinski, M., Luby, M., Approximating the Number of Solutions of a GF[2] Polynomial, Proc. 2nd ACM-SIAM SODA (1991), pp. 300–303.
Karpinski, M., Lhotzky, B., An (ε, δ)-Approximation Algorithm for the Number of Zeros for a Multilinear Polynomial over GF[q], Technical Report TR-91-022, International Computer Science Institute, Berkeley, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karpinski, M. (1991). Approximation algorithms for counting problems in finite fields. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1991. Lecture Notes in Computer Science, vol 529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54458-5_48
Download citation
DOI: https://doi.org/10.1007/3-540-54458-5_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54458-6
Online ISBN: 978-3-540-38391-8
eBook Packages: Springer Book Archive