2766 search results - page 104 / 554 » Algorithms for trigonometric polynomials |
169
click to vote
IPCO
2008
15 years 5 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
136
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
SIAMDM
2008
15 years 3 months ago
2008
In a recent paper, Dur
139
click to vote
IPL
2010
15 years 1 months ago
2010
Polynomial algorithms are given for the following two problems:
163
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...