Sciweavers

APPROX
2010
Springer
120views Algorithms» more  APPROX 2010»
13 years 6 months ago
Uniform Derandomization from Pathetic Lower Bounds
A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...
Eric Allender, Vikraman Arvind, Fengming Wang
GLVLSI
2007
IEEE
171views VLSI» more  GLVLSI 2007»
13 years 11 months ago
Combinational equivalence checking for threshold logic circuits
Threshold logic is gaining prominence as an alternative to Boolean logic. The main reason for this trend is the availability of devices that implement these circuits efficiently (...
Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevo...