796 search results - page 15 / 160 » Approximating the centroid is hard |
105
Voted
JCO
2008
15 years 1 months ago
2008
112
Voted
SIAMCOMP
2008
15 years 1 months ago
2008
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
71
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
128
click to vote
COCO
2005
Springer
15 years 7 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 ...
105
click to vote
CC
2007
Springer
15 years 1 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 ...