Abstract
This paper describes an application of some ideas from homotopy theory to the problem of computing the number of solutions to a multivariate polynomial equation over a finite field. The benefit of the homotopy approach over more direct methods is that the running-time is far less dependent on the number of variables. The method was introduced by the author in another paper, where specific complexity estimates were obtained for certain special cases. Some consequences of these estimates are stated in the present paper.
The author is supported by the EPSRC (Grant GR/N35366/01) and St John’s College, Oxford.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.-P. Dedieu, Newton’s method and some complexity aspects of the zero-finding problem, in “Foundations of Computational Mathematics”, (R.A. DeVore, A. Iserles, E. Suli), LMS Lecture Note Series 284, Cambridge University Press, 2001, 45–67.
B. Dwork, On the zeta function of a hypersurface II, Ann. Math. (2) 80, (1964), 227–299.
J. von zur Gathen and J. Gerhard, Modern Computer Algebra, Cambridge University Press, 1999.
N.M. Katz, On the differential equations satisfied by period matrices, Pub. Math. IHES 35, (1968), 71–106.
K. Kedlaya, Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology, Journal of the Ramanujan Mathematical Society, 16 (2001), 323–338.
A.G.B. Lauder, Deformation theory and the computation of zeta functions, submitted. Preprint available at: http://web.comlab.ox.ac.uk/oucl/work/alan.lauder/
A.G.B. Lauder and D. Wan, Counting points on varieties over finite fields of small characteristic, to appear in Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography (Mathematical Sciences Research Institute Publications), J.P. Buhler and P. Stevenhagen (eds), Cambridge University Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lauder, A.G.B. (2003). Homotopy Methods for Equations over Finite Fields. In: Fossorier, M., Høholdt, T., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2003. Lecture Notes in Computer Science, vol 2643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44828-4_3
Download citation
DOI: https://doi.org/10.1007/3-540-44828-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40111-7
Online ISBN: 978-3-540-44828-0
eBook Packages: Springer Book Archive