Testing of matrix properties
From MaRDI portal
Recommendations
Cites work
Cited in
(19)- Functions that have read-once branching programs of quadratic size are not necessarily testable
- A large lower bound on the query complexity of a simple Boolean function
- Testing hypergraph colorability
- Efficient removal lemmas for matrices
- Property testing for point sets on the plane
- Testing of matrix-poset properties
- Testing matrix function algorithms using identities
- Partial tests, universal tests and decomposability
- scientific article; zbMATH DE number 3843068 (Why is no real title available?)
- Testing monotonicity over graph products
- Testing graphs for colorability properties*
- Testing for forbidden posets in ordered rooted forests
- Efficient removal lemmas for matrices
- Testing local properties of arrays
- Earthmover Resilience and Testing in Ordered Structures
- Testing balancedness and perfection of linear matrices
- Property testing of curve similarity
- Property testing of the Boolean and binary rank
- Distribution-free connectivity testing for sparse graphs
This page was built for publication: Testing of matrix properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175981)