Composition of low-error 2-query PCPs using decodable PCPs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Irit Dinur, Prahladh Harsha. Composition of low-error 2-query PCPs using decodable PCPs. Electronic Colloquium on Computational Complexity (ECCC), 16:42, 2009. [doi]

The following publications are possibly variants of this publication:

Composition of Low-Error 2-Query PCPs Using Decodable PCPsIrit Dinur, Prahladh Harsha. propertytesting 2010: 280-288 [doi]

Composition of Low-Error 2-Query PCPs Using Decodable PCPsIrit Dinur, Prahladh Harsha. focs 2009: 472-481 [doi]

Composition of Low-Error 2-Query PCPs Using Decodable PCPsIrit Dinur, Prahladh Harsha. SICOMP, 42(6):2452-2486, 2013. [doi]

Polynomially Low Error PCPs with polyloglogn Queries via Modular CompositionIrit Dinur, Prahladh Harsha, Guy Kindler. eccc, 22:85, 2015. [doi]

Polynomially Low Error PCPs with polyloglog n Queries via Modular CompositionIrit Dinur, Prahladh Harsha, Guy Kindler. stoc 2015: 267-276 [doi]

PCPs with small soundness errorIrit Dinur. sigact, 39(3):41-57, 2008. [doi]

Small PCPs with low query complexityPrahladh Harsha, Madhu Sudan. cc, 9(3-4):157-201, 2000. [doi]

Small PCPs with low query complexityPrahladh Harsha, Madhu Sudan. eccc, 7(61), 2000. [doi]

Small PCPs with Low Query ComplexityPrahladh Harsha, Madhu Sudan. STACS 2001: 327-338 [doi]

runs on WebDSL