1941 search results - page 21 / 389 » On the Hardness of Approximate Reasoning |
176
click to vote
COCO
2011
Springer
13 years 11 months ago
2011
Springer
—In 1997, H˚astad showed NP-hardness of (1 − , 1/q + δ)-approximating Max-3Lin(Zq); however it was not until 2007 that Guruswami and Raghavendra were able to show NP-hardness...
FSTTCS
2007
Springer
15 years 6 months 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...
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
119
click to vote
ECCC
2010
14 years 12 months ago
2010
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
GIS
2008
ACM
14 years 11 months ago
2008
ACM