Answers are grounded in this paper and cite their sources.
The binary rank of a binary matrix is the minimum number of disjoint all-one rectangles that partition its one-entries. We study entry-query testing of binary rank at most d, with one-sided error and nonadaptive queries. We give a tester using O(d⁴/ε²) queries, independent of the matrix dimensions and a general lower bound of Ω(d3/2/ε).
No takes yet. Share an insight, caveat, or question.
Nader H. Bshouty (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: