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 M. Blum et al. (J. Comput. System Sci.47 (1993), 549?595) to check the linear consistency of three functions f1, f2, f3 mapping a finite Abelian group G to an Abelian group H:Pick x, y?G uniformly and independently at random and check if f1(x)+f2(y)=f3(x+y). We analyze this test for two cases: (1) G and H are arbitrary Abelian groups and (2) G=Fn2 and H=F2. 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 J. Hastad 9 (in “Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, Texas, 4?6 May 1997,” pp. 1?10). It is abstracted explicitly for the first time here. As an application of our results we give yet another new and tight characterization of NP, namely ??>0, NP=MIP1??, 1/2O(logn), 3, 1. That is, every language in NP has 3-prover 1-round proof systems in which the verifier tosses O(logn) coins and asks each of the three provers one question each. The provers respond with one bit each such that the verifier accepts instance of the language with probability 1?? and rejects noninstances with probability at least 12. Such a result is of some interest in the study of probabilistically checkable proofs.
[1]
Luca Trevisan,et al.
Positive Linear Programming, Parallel Approximation and PCP's
,
1996,
ESA.
[2]
Mihir Bellare,et al.
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
,
1998,
SIAM J. Comput..
[3]
Luca Trevisan,et al.
Recycling queries in PCPs and in linearity tests (extended abstract)
,
1998,
STOC '98.
[4]
Luca Trevisan,et al.
A PCP characterization of NP with optimal amortized query complexity
,
2000,
STOC '00.
[5]
Carsten Lund,et al.
Efficient probabilistically checkable proofs and applications to approximations
,
1993,
STOC.
[6]
Carsten Lund,et al.
Proof verification and the hardness of approximation problems
,
1998,
JACM.
[7]
Ran Raz.
A Parallel Repetition Theorem
,
1998,
SIAM J. Comput..
[8]
Uri Zwick,et al.
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint
,
1998,
SODA '98.
[9]
Mihir Bellare,et al.
Linearity testing in characteristic two
,
1996,
IEEE Trans. Inf. Theory.
[10]
Manuel Blum,et al.
Self-testing/correcting with applications to numerical problems
,
1990,
STOC '90.
[11]
Mihir Bellare,et al.
Free bits, PCPs and non-approximability-towards tight results
,
1995,
Proceedings of IEEE 36th Annual Foundations of Computer Science.
[12]
Sanjeev Arora,et al.
Probabilistic checking of proofs: a new characterization of NP
,
1998,
JACM.
[13]
Johan Håstad,et al.
Some optimal inapproximability results
,
2001,
JACM.