← 研踪 PaperTrailarXiv:2611.14163 · v1
Nonadaptive One-Sided Testing of Binary Rank
首次提交 2026-11-10 22:47
版本更新 2026-11-10 22:47
雷达观测 2026-11-11 13:08
摘要
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 , with one-sided error and nonadaptive queries. We give a tester using queries, independent of the matrix dimensions and a general lower bound of .
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-10 22:47 · 最新观测版本
Nonadaptive One-Sided Testing of Binary Rank
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 , with one-sided error and nonadaptive queries. We give a tester using queries, independent of the matrix dimensions and a general lower bound of .
查看此版本解读 →查看此版本原文 ↗