2766 search results - page 150 / 554 » Algorithms for trigonometric polynomials |
208
Voted
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider exchange economies where the traders’ preferences are expressed in terms of the extensively used constant elasticity of substitution (CES) utility functions...
141
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
177
click to vote
COCO
2000
Springer
15 years 8 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 ...
133
click to vote
COCO
2008
Springer
15 years 6 months ago
2008
Springer
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is equivalent to one query. That is, ZPPSAT[1] = ZPPSAT [2] = ...
131
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...