'Trevisan' presentation slideshows

How NP got a new definition:

How NP got a new definition:. Probabilistically Checkable Proofs (PCPs) & Approximation Properties of NP-hard problems. SANJEEV ARORA PRINCETON UNIVERSITY. Talk Overview. Recap of NP-completeness and its philosophical importance. Definition of approximation.

819 views • 54 slides

Direct-product testing, and a new 2-query PCP

491 views • 38 slides

Sparse Random Linear Codes are Locally Decodable and Testable

Sparse Random Linear Codes are Locally Decodable and Testable. Tali Kaufman (MIT) Joint work with Madhu Sudan (MIT). Error-Correcting Codes. Code C ? {0,1} n - collection of vectors ( codewords ) of length n. Linear Code - codewords form a linear subspace

329 views • 16 slides