Nothing Special   »   [go: up one dir, main page]

skip to main content
10.5555/1759840.1759843guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Homotopy methods for equations over finite fields

Published: 12 May 2003 Publication History

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.

References

[1]
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.
[2]
B. Dwork, On the zeta function of a hypersurface II, Ann. Math. (2) 80, (1964), 227-299.
[3]
J. von zur Gathen and J. Gerhard, Modern Computer Algebra, Cambridge University Press, 1999.
[4]
N.M. Katz, On the differential equations satisfied by period matrices, Pub. Math. IHES 35, (1968), 71-106.
[5]
K. Kedlaya, Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology, Journal of the Ramanujan Mathematical Society, 16 (2001), 323-338.
[6]
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/
[7]
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.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
AAECC'03: Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
May 2003
265 pages
ISBN:3540401113
  • Editors:
  • Marc Fossorier,
  • Tom Høholdt,
  • Alain Poli

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 12 May 2003

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 24 Nov 2024

Other Metrics

Citations

View Options

View options

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media