Sciweavers

12 search results - page 3 / 3
» Pseudorandom Generators, Typically-Correct Derandomization, ...
Sort
View
TIT
2008
116views more  TIT 2008»
13 years 5 months ago
On the Complexity of Hardness Amplification
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...
Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
13 years 9 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam