Sciweavers

2766 search results - page 104 / 554
» Algorithms for trigonometric polynomials
Sort
View
142
Voted
IPCO
2008
129views Optimization» more  IPCO 2008»
15 years 2 months ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
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...
Klaus Jansen, Roberto Solis-Oba
108
Voted
SODA
2001
ACM
92views Algorithms» more  SODA 2001»
15 years 2 months ago
On universally easy classes for NP-complete problems
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...
Erik D. Demaine, Alejandro López-Ortiz, J. ...
SIAMDM
2008
61views more  SIAMDM 2008»
15 years 1 months ago
Unit Circular-Arc Graph Representations and Feasible Circulations
In a recent paper, Dur
Min Chih Lin, Jayme Luiz Szwarcfiter
113
Voted
IPL
2010
158views more  IPL 2010»
14 years 10 months ago
Finding bipartite subgraphs efficiently
Polynomial algorithms are given for the following two problems:
Dhruv Mubayi, György Turán
129
Voted
FOCS
1998
IEEE
15 years 5 months ago
Quantum Lower Bounds by Polynomials
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 ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...