70 search results - page 6 / 14 » Improved Pseudorandom Generators for Depth 2 Circuits |
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
111
click to vote
PAMI
2007
14 years 9 months ago
2007
In this paper we present a two-level generative model for representing the images and surface depth maps of drapery and clothes. The upper level consists of a number of folds whic...
COCO
2006
Springer
15 years 1 months ago
2006
Springer
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...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
83
Voted
ASPDAC
2008
ACM
14 years 11 months ago
2008
ACM
Scaling is currently the most popular technique used to improve performance metrics of CMOS circuits. This cannot go on forever because the properties that are responsible for the ...