Sciweavers

2766 search results - page 46 / 554
» Algorithms for trigonometric polynomials
Sort
View
68
Voted
AAECC
2006
Springer
90views Algorithms» more  AAECC 2006»
15 years 23 days ago
Apparent singularities of linear difference equations with polynomial coefficients
Sergei A. Abramov, Moulay A. Barkatou, Mark van Ho...
COCO
2003
Springer
88views Algorithms» more  COCO 2003»
15 years 6 months ago
On Derandomizing Tests for Certain Polynomial Identities
We extract a paradigm for derandomizing tests for polynomial identities from the recent AKS primality testing algorithm. We then discuss its possible application to other tests.
Manindra Agrawal
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
16 years 1 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka
90
Voted
ICA3PP
2010
Springer
15 years 5 months ago
Modular Resultant Algorithm for Graphics Processors
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
Pavel Emeliyanenko
COLT
2000
Springer
15 years 5 months ago
Average-Case Complexity of Learning Polynomials
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...
Frank Stephan, Thomas Zeugmann