跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

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 dd, with one-sided error and nonadaptive queries. We give a tester using O~(d4/ε2)\tilde O(d^4/ε^2) queries, independent of the matrix dimensions and a general lower bound of Ω~(d3/2/ε)\tilde Ω(d^{3/2}/ε).

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 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 dd, with one-sided error and nonadaptive queries. We give a tester using O~(d4/ε2)\tilde O(d^4/ε^2) queries, independent of the matrix dimensions and a general lower bound of Ω~(d3/2/ε)\tilde Ω(d^{3/2}/ε).

查看此版本解读 →查看此版本原文 ↗