1. Lidl, R., Niederreiter, H.: Finite Fields, Encylopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (1997)
2. Ehrenfeucht, A., Karpinski, M.: The computational complexity of (xor, and)- counting problems. Technical Report 8543-CS, ICSI, Berkeley (1990)
3. Karpinski, M., Luby, M.: Approximating the number of zeroes of a GF[2] polynomial. Journal of Algorithms 14(2), 280–287 (1993)
4. Grigoriev, D., Karpinski, M.: An approximation algorithm for the number of zeroes of arbitrary polynomials over GF[q]. In: 32nd IEEE Symposium on Foundations of Computer Science, pp. 662–669 (1991)
5. Luby, M., Velicković, B., Wigderson, A.: Deterministic approximate counting of depth-2 circuits. In: Israel Symposium on Theory of Computing Systems, pp. 18–24 (1993)