25 search results - page 2 / 5 » Query-Efficient Algorithms for Polynomial Interpolation over... |
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a fi...
ISSAC
2004
Springer
15 years 3 months ago
2004
Springer
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
DCC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
COLT
2000
Springer
15 years 1 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...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n1+o(1) log1+o(1) q bit operations; this had earlier been achiev...