22 search results - page 2 / 5 » On uniform amplification of hardness in NP |
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
ECCC
2010
13 years 5 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
TIT
2008
13 years 5 months ago
2008
We study the task of transforming a hard function f, with which any small circuit disagrees on (1 - )/2 fraction of the input, into a harder function f , with which any small circ...
FSTTCS
2004
Springer
13 years 11 months ago
2004
Springer
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
FOCS
1999
IEEE
13 years 10 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...