6 search results - page 1 / 2 » Tight bounds on computing error-correcting codes by bounded-... |
STOC
2012
ACM
11 years 7 months ago
2012
ACM
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
MST
2010
13 years 3 months ago
2010
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...
ICCAD
2000
IEEE
13 years 9 months ago
2000
IEEE
A high accuracy system for transistor-level static timing analysis is presented. Accurate static timing verification requires that individual gate and interconnect delays be accu...
DAC
2004
ACM
14 years 5 months ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...