152 search results - page 4 / 31 » Tetris is Hard, Even to Approximate |
172
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
156
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
142
click to vote
SAGT
2009
Springer
16 years 17 days ago
2009
Springer
We study economic means to improve network performance in the well-known game theoretic traffic model due to Wardrop. We introduce two sorts of spam flow - auxiliary and adversari...
147
click to vote
FSTTCS
2007
Springer
16 years 6 days ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
185
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...