1092 search results - page 17 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
155
click to vote
CASC
2011
Springer
13 years 11 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...
109
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
STOC
2005
ACM
16 years 1 days ago
2005
ACM
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 ...
108
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
134
click to vote
COCO
2000
Springer
15 years 4 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...