Sciweavers

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

92

STOC
2007
ACM

83views Algorithms» more STOC 2007»

Verifying and decoding in constant depth

16 years 3 months ago

Verifying and decoding in constant depth

Download www.alexhealy.net

Shafi Goldwasser, Dan Gutfreund, Alexander Healy,

Real-time Traffic

Algorithms | Constant Depth | STOC 2007 |

claim paper

Related Content

» On the Number of Samples Needed in Light Field Rendering with ConstantDepth Assumption

» Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuit...

» The Complexity of Local List Decoding

» A Case of Depth3 Identity Testing Sparse Factorization and Duality

» Statistical Compressed Sensing of Gaussian Mixture Models

» Protecting Circuits from Leakage the ComputationallyBounded and Noisy Cases

» NoCGEN A Template Based Reuse Methodology for Networks on Chip Architecture

» ContextBounded Model Checking of Concurrent Software

» Zeroknowledge from secure multiparty computation

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum

Comments (0)