A Query Efficient Non-adaptive Long Code Test with Perfect Completeness
نویسندگان
چکیده
Long Code testing is a fundamental problem in the area of property testing and hardness of approximation. In this paper, we study how small the soundness s of the Long Code test with perfect completeness can be by using non-adaptive q queries. We show that s = (2q+3)/2 is possible, where q is of the form 2 − 1 for any integer k > 2.
منابع مشابه
A -Query Non-Adaptive PCP with Perfect Completeness
We study a very basic open problem regarding the PCP characterization of NP, namely, the power of PCPs with non-adaptive queries and perfect completeness. Optimal results are known if one sacrifices either non-adaptiveness or perfect completeness. Håstad [11] constructs a -query non-adaptive PCP with soundness but it loses prefect completeness ( is an arbitrarily small constant). Guruswami et a...
متن کاملQuery Efficient PCPs with Perfect Completeness
For every integer k > 0, and an arbitrarily small constant ε > 0, we present a PCP characterization of NP where the verifier uses logarithmic randomness, non-adaptively queries 4k + k2 bits in the proof, accepts a correct proof with probability 1, i. e., it has perfect completeness, and accepts any supposed proof of a false statement with probability at most 2−k 2 + ε . In particular, the verif...
متن کاملA Hypergraph Dictatorship Test with Perfect Completeness
A hypergraph dictatorship test is first introduced by Samorodnitsky and Trevisan in [21] and serves as a key component in their unique games based PCP construction. Such a test has oracle access to a collection of functions and determines whether all the functions are the same dictatorship, or all their low degree influences are o(1). The test in [21] makes q ≥ 3 queries and has amortized query...
متن کاملThree-Query PCPs with Perfect Completeness over non-Boolean Domains
We study non-Boolean PCPs that have perfect completeness and read three positions from the proof. For the case when the proof consists of values from a domain of size d for some integer constant d ≥ 2, we construct a non-adaptive PCP with perfect completeness and soundness d−1+d−2+ε, for any constant ε > 0, and an adaptive PCP with perfect completeness and soundness d−1 + ε, for any constant ε ...
متن کاملComment on TR07-090
The result of the paper can be deduced from already known results in [ST06] and [BHR05]. 1 MainAfter publishing the paper in ECCC, it has come to my attention that the result provenin the paper, lower bounds for adaptive linearity tests, can be deduced from alreadyknown results.As stated in the paper, the lower bound for non-adaptive linearity tests was provenby Samorodnitsk...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 47 شماره
صفحات -
تاریخ انتشار 2009