2766 search results - page 21 / 554 » Algorithms for trigonometric polynomials |
114
click to vote
CAP
2010
14 years 10 months ago
2010
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
143
click to vote
STOC
1989
ACM
15 years 7 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
187
click to vote
CASC
2011
Springer
14 years 2 months ago
2011
Springer
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
119
Voted
EUROCRYPT
2000
Springer
15 years 6 months ago
2000
Springer
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard ove...
181
click to vote
ISTCS
1997
Springer
15 years 7 months ago
1997
Springer
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...