A Hypergraph Dictatorship Test with Perfect Completeness

@article{Chen2008AHD,
  title={A Hypergraph Dictatorship Test with Perfect Completeness},
  author={Victor Chen},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2008},
  volume={15}
}
A hypergraph dictatorship test is first introduced by Samoro dnitsky 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 func tions are the same dictatorship, or all their low degree influences are o(1). The test in [21] makesq ≥ 3 queries and has amortized query complexity 1 + O ( log q q ) but has an inherent loss of perfect completeness. In this pap er we… CONTINUE READING
BETA

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

A query efficient non-adaptive long code test with perfect completeness

  • Random Struct. Algorithms
  • 2015
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

A Query Efficient Non-Adaptive Long Code Test with Perfect Completeness

  • Electronic Colloquium on Computational Complexity
  • 2009
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 25 REFERENCES

On the power of unique 2-prover 1-round games

  • STOC
  • 2002
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Testi ng basic boolean formulae

Michal Parnas, Dana Ron, Alex Samorodnitsky
  • SIAM Journal on Discrete Mathematics
  • 2002
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Query efficient PCPs with perfect completeness

  • Proceedings 2001 IEEE International Conference on Cluster Computing
  • 2001
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Low-degree tests at large distanc es

Alex Samorodnitsky
  • InSTOC ’07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing ,
  • 2007
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Simple analysis of graph tests for linearity and PCP

  • Random Struct. Algorithms
  • 2003
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

A tight characterization of NP with 3 query PCPs

  • Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
  • 1998
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL