1379 search results - page 4 / 276 » The Complexity of the Annihilating Polynomial |
EUROCRYPT
2012
Springer
13 years 9 days ago
2012
Springer
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
COLT
2000
Springer
15 years 2 months ago
2000
Springer
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
DATE
1999
IEEE
15 years 2 months ago
1999
IEEE
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
FOCM
2008
14 years 10 months ago
2008
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
MST
2011
14 years 22 days ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...