Abstract
We present here some recent results on fast parallel interpolation of multivariate polynomials over finite fields. Some applications towards the general conversion algorithms for boolean functions are also formulated.
Supported in part by Leibniz Center for Research in Computer Science, by the DFG Grant KA 673/2-1, and by the SERC Grant GR-E 68297
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Adleman, L.M., Lenstra, H.K., Finding Irreducible Polynomials over Finite Fields, Proc. 18th ACM STOC (1986), pp. 350–355.
Ben-Or, M., Probabilistic Algorithms in Finite Fields, Proc. 22th IEEE FOCS (1981), pp. 394–398.
Ben-Or, M., Tiwari, P., A Deterministic Algorithm for Sparse Multivariate Polynomial Interpolation, Proc. 20th ACM STOC (1988), pp. 301–309.
Berlekamp, E.R., Factoring Polynomials over Large Finite Fields, Math. Comp. 24 (1970), pp. 713–753.
Cauchy, A.L., Exercises d'Analyse et de Phys. Math., Vol 2, Paris, Bachelier (1841), pp.151–159.
Clausen, M., Dress, A., Grabmeier, J., Karpinski, M., On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials over Finite Fields, Research Report No.8522-CS, University of Bonn (1988); to appear in Theoretical Computer Science (1989).
Cook, S.A., A Taxonomy of Problems with Fast Parallel Algorithms, Information and Control 64 (1985), pp. 2–22.
von zur Gathen, J., Factoring Sparse Multivariate Polynomials, Proc. 24th IEEE FOCS (1983), pp. 172–179.
von zur Gathen, J., Parallel Algorithm for Algebraic Problems, SIAM J. Comput., 13 (1984), 808–824.
Grigoriev, D.Y., Karpinski, M., The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents is in NC, Proc. 28th IEEE FOCS (1987), Los Angeles, 1987, pp. 166–172.
Grigoriev, D.Y., Karpinski, M., Singer, M.F., Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields, Research Report No.8523-CS, University of Bonn (1988); submitted to SIAM J. Comput., 1988.
Kaltofen, E., Computing with Polynomials Given by Straight-Line Programs I, Greatest Common Divisors, Proc. 17th ACM STOC (1985), pp. 131–142.
Kaltofen, E., Trager, B., Computing with Polynomials Given by Black Boxes for their Evaluations: Greatest Common Divisor, Factorization, Seperation of Numerators and Denominators, Proc. 29th IEEE FOCS (1988), pp. 296–305.
Karp, R.M., Remachandran, V., A Survey of Parallel Algorithms for Shared-Memory Machines, Research Report No. UCB/CSD 88/407, University of California, Berkeley (1988); to appear in Handbook of Theoretical Computer Science, North Holland (1989).
Lidl, H., Niederreiter, H., Finite Fields, Encyclopedia of Mathematics and its Applications, Vol.10, Cambridge University Press (1983).
MacWilliams, F.J., Sloane, N.J.A., The Theory of Error Correcting Codes, North Holland (1972).
Wegener, I., The Complexity of Boolean Functions, Teubner (1987).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karpinski, M. (1989). Boolean circuit complexity of algebraic interpolation problems. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '88. CSL 1988. Lecture Notes in Computer Science, vol 385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026299
Download citation
DOI: https://doi.org/10.1007/BFb0026299
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51659-0
Online ISBN: 978-3-540-46736-6
eBook Packages: Springer Book Archive