2766 search results - page 54 / 554 » Algorithms for trigonometric polynomials |
88
Voted
SODA
1992
ACM
15 years 1 months ago
1992
ACM
In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simp...
108
click to vote
CORR
2008
Springer
15 years 24 days ago
2008
Springer
We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function f : {0, 1}n {-1, 1} is an s-sparse GF(2) polynomial versus -far ...
78
Voted
JSC
2006
15 years 20 days ago
2006
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
109
click to vote
ISSAC
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. ...
95
Voted
EUROCRYPT
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in p...