1998 search results - page 14 / 400 » Complexity of the Cover Polynomial |
CC
2007
Springer
13 years 9 months ago
2007
Springer
COLT
2000
Springer
14 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
14 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...
DCC
2002
IEEE
13 years 9 months ago
2002
IEEE
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
FOCM
2008
13 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...