Algorithms for Modular Counting of Roots of Multivariate Polynomials
- 17 October 2007
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 50 (4) , 479-496
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Modular Counting of Rational Points over Finite FieldsFoundations of Computational Mathematics, 2007
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-HardIEEE Transactions on Information Theory, 2005
- Counting curves and their projectionscomputational complexity, 1996
- Improvements of the Chevalley-Warning and the Ax-Katz TheoremsAmerican Journal of Mathematics, 1995
- Counting points on elliptic curves over finite fieldsJournal de Théorie des Nombres de Bordeaux, 1995
- On ACCcomputational complexity, 1994
- Approximating the Number of Zeroes of a GF[2] PolynomialJournal of Algorithms, 1993
- Frobenius maps of abelian varieties and finding roots of unity in finite fieldsMathematics of Computation, 1990
- NP is as easy as detecting unique solutionsTheoretical Computer Science, 1986
- The complexity of computing the permanentTheoretical Computer Science, 1979