Homotopy methods for equations over finite fields

Journal article

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 runningtime 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. © Springer-Verlag Berlin Heidelberg 2003.

Authors: Lauder, A

• Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
• Volume: 2643
• Pages: 18-23
• Publication date: 2003-01-01
• EISSN: 1611-3349
• ISSN: 0302-9743
• Language: English