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= F2n 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. Håstad (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/2[O(log n),3,1]. That is, every language in NP has 3-prover 1-round proof systems in which the verifier tosses O(log n) 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 1/2. Such a result is of some interest in the study of probabilistically checkable proofs.
|Number of pages||19|
|Journal||Journal of Computer and System Sciences|
|State||Published - Jun 2001|
Bibliographical noteFunding Information:
We thank the reviewers of RANDOM’99 as well as the referee of the current paper for numerous comments and corrections. M.O.R.’s research was supported in part by NSF grant NSF-CCR-97-00365. M.S.’s research was supported in part by a Sloan Foundation Fellowship, and MIT-NEC Research Initiation Grant, and NSF Career Award CCR-9875511.