Testing of matrix properties

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 286-295

  Fischer, E ^a   Newman, I ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

Matrix properties; Property testing

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBABILITY; STATISTICAL TESTS;

BIPARTITE GRAPHS; MATRIX PROPERTIES;

MATRIX ALGEBRA;

EID: 0034825321     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380812     Document Type: Conference Paper

References (17)

1. Efficient testing of large graphs
2. Regular languages are testable with a constant number of queries
3. Proof verification and the hardness of approximation problems
4. Fast approximate PCPs for multidimensional bin-packing problems
5. Self-testing/correcting with applications to numerical problems
6. Improved testing algorithms for monotonicity
7. Spot checkers
8. Testing graphs for colorability properties
9. Self-testing/correcting for polynomials and for approximate functions
10. On a problem of K. Zarankiewicz
11. Property testing and its connections to learning and approximation
12. Property testing in bounded degree graphs
13. Testing of function that have small width branching programs
14. Robust characterization of polynomials with applications to program testing
15. Probabilistic computation, towards a unified measure of complexity
16. Problem P 101