Journal title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI
10.1007/3-540-44828-4_3
Volume
2643
Last updated
2025-04-09T10:07:40.23+01:00
Page
18-23
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 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.
Symplectic ID
148478
Submitted to ORA
Off
Favourite
Off
Publication type
Journal Article
Publication date
01 Jan 2003