MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Linear consistency testing (1999) [5 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Yonatan Aumann, Johan Hastad, Michael O. Rabin
In Proceedings of RANDOM
http://www.toc.lcs.mit.edu/~madhu/papers/ahrs.ps
Add To MetaCart

Abstract:

We extend the notion of linearity testing to the task of checking linear-consistency of multiple functions. Informally, functions are "linear " if their graphs form straight lines on the plane. Two such functions are "consistent " if the lines have the same slope. We propose a variant of a test of Blum, Luby and Rubinfeld [8] to check the linear-consistency of three functions f 1; f 2; f 3 mapping a finite Abelian group G to an Abelian group H: Pick x; y 2 G uniformly and independently at random and check if f 1 (x) + f 2 (y) = f 3 (x + y). We analyze this test for two cases: (1) G and H are arbitrary Abelian groups and (2) G = F n 2 and H = F 2. Questions bearing close relationship to linear-consistency testing seem to have been implicitly considered in recent work on the construction of PCPs (and in particular in the work of Hastad [9]). It is abstracted explicitly for the first time here. We give an application of this problem (and of our results): A (yet another) new and tight characterization of NP, namely 8ffl? 0; NP = MIP 1\Gammaffl;

Citations

515 Proof verification and hardness of approximation problems – Arora, Lund, et al. - 1992
288 Probabilistic checking of proofs: a new characterization of np – Arora, Safra - 1998
256 Designing programs that check their work – Blum, Kannan - 1995
233 Self-testing/correcting with applications to numerical problems – Blum, Luby, et al. - 1993
195 Free bits, PCPs, and nonapproximability-- towards tight results – Bellare, Goldreich, et al. - 1998
181 Efficient probabilistically checkable proofs and applications to approximations – Bellare, Goldwasser, et al. - 1993
175 A Parallel Repetition Theorem – Raz - 1998
49 Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint – Zwick - 1998
46 Proof Veri and Hardness of Approximation Problems – Arora, Lund, et al. - 1998
39 A PCP characterization of NP with optimal amortized query complexity – Samorodnitsky, Trevisan - 2000
35 Linearity testing in characteristic two – Bellare, Coppersmith, et al. - 1995
31 Some optimal inapproximability results – astad
25 Recycling queries in PCPs and in linearity tests – Trevisan - 1998
22 Positive linear programming, parallel approximation, and PCP's – Trevisan - 1996
22 Ecient probabilistically checkable proofs and applications to approximation – Bellare, Goldwasser, et al. - 1993
2 Simple analysis of graph tests. Manuscript – astad, Wigerson - 2000