85 search results - page 9 / 17 » A note on circuit lower bounds from derandomization |
ALGOSENSORS
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
ICCAD
1997
IEEE
14 years 24 days ago
1997
IEEE
A power estimation approach is presented in which blocks of consecutive vectors are selected at random from a user-supplied realistic input vector set and the circuit is simulated...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
COCO
2003
Springer
14 years 1 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
ISLPED
1997
ACM
14 years 4 days ago
1997
ACM
New measures of peak power in the context of sequential circuits are proposed. This paper presents an automatic procedure to obtain very good lower bounds on these measures as wel...