Monotonicity testing over general poset domains

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 474-483

  Fischer, Eldar ^a   Lehman, Eric ^a   Newman, Ilan ^a   Raskhodnikova, Sofya ^a   Rubinfeld, Ronitt ^a   Samorodnitsky, Alex ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Algorithms; Monotone functions; Property testing

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; BOUNDARY CONDITIONS; GRAPH THEORY; PROBLEM SOLVING; QUERY LANGUAGES;

GENERAL POSET DOMAINS; MONOTONICITY TESTING;

COMPUTATIONAL COMPLEXITY;

EID: 0036039104     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509977     Document Type: Conference Paper

References (25)

1. Efficient testing of large graphs
2. Regular languages are testable with a constant number of queries
3. Fast approximation PCPs for multidimensional bin-packing problems
4. On sets of integers which contain no three terms in arithmetic progression
5. Property testing in computational geometry
6. A decomposition theorem for partially ordered sets
7. Improved testing algorithms for monotonicity
8. Spot checkers
9. On the strength of comparisons in property testing, manuscript
10. The art of uninformed decisions: A primer to property testing
11. Functions that have read-twice constant width branching programs are not necessarily testable
12. Testing of matrix properties
13. Property testing and its connection to learning and approximation
14. Testing monotonicity
15. Property testing in bounded degree graphs
16. Simple analysis of graph tests for linearity and PCP
17. Upper bounds for codes with a fixed weight of vectors (in Russian)
18. A separator theorem for planar graphs
19. Monotonicity testing
20. Property testing (a tutorial)
21. Robust characterization of polynomials with applications to program testing
22. Triple systems with no six points carrying three triangles