Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

STOC
2012
ACM

favoriteEmaildiscussreport

197views Algorithms» more STOC 2012»

Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates

11 years 6 months ago

Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates

Download www.ccs.neu.edu

Anna Gál, Kristoffer Arnsfelt Hansen, Micha

Real-time Traffic

Algorithms | STOC 2012 |

claim paper

Related Content

» The Complexity of Local List Decoding

» Entropy of Operators or why Matrix Multiplication is Hard for DepthTwo Circuits

» TransistorLevel Timing Analysis Using Embedded Simulation

» Fast statistical timing analysis handling arbitrary delay correlations

» Secure Arithmetic Computation with No Honest Majority

Post Info
More Details (n/a)

Added	28 Sep 2012
Updated	28 Sep 2012
Type	Journal
Year	2012
Where	STOC
Authors	Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola

Comments (0)