Partial tests, universal tests and decomposability

@inproceedings{Fischer2014PartialTU,
  title={Partial tests, universal tests and decomposability},
  author={Eldar Fischer and Yonatan Goldhirsh and Oded Lachish},
  booktitle={ITCS},
  year={2014}
}
For a property P and a sub-property P', we say that P is P'-partially testable with q queries} if there exists an algorithm that distinguishes, with high probability, inputs in P' from inputs ε-far from P, using q queries. Some natural properties require many queries to test, but can be partitioned into a small number of subsets for which they are partially testable with very few queries, sometimes even a number independent of the input size. For properties over {0,1}, the notion of being thus… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
16 Citations
7 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Information and information stability of random variables and processes

  • Mark S. Pinsker
  • Holden-Day Inc., San Francisco,
  • 1964
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…