Sciweavers

2766 search results - page 49 / 554
» Algorithms for trigonometric polynomials
Sort
View
78
Voted
CIAC
2006
Springer
75views Algorithms» more  CIAC 2006»
15 years 4 months ago
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
61
Voted
STOC
1991
ACM
89views Algorithms» more  STOC 1991»
15 years 4 months ago
The Expressive Power of Voting Polynomials
James Aspnes, Richard Beigel, Merrick L. Furst, St...
117
Voted
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 22 days ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
JACM
2000
119views more  JACM 2000»
15 years 14 days ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
113
Voted
MOC
2011
14 years 3 months ago
Calculating cyclotomic polynomials
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...
Andrew Arnold, Michael B. Monagan