Metraipolis › archive › dc_da3cd4170935

Submodularity Is Barely Testable — arXiv:2611.02374

Source: arXiv (en)
Original: https://arxiv.org/abs/2611.02374
License (as archived): CC0-1.0
Archived: 2026-11-03T18:58:58.287Z
SHA-256 of the archived text: 5d41e2401ca2c9ea6f9af6c5abbfb08a6abf5c86bc7f3e1276badcadd437b2dc
Stable URL of this page: https://metraipolis.com/documento/dc_da3cd4170935

How to cite

Submodularity Is Barely Testable — arXiv:2611.02374 — arXiv (en), https://arxiv.org/abs/2611.02374 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_da3cd4170935 (Metraipolis archive dc_da3cd4170935, sha256 5d41e2401ca2c9ea6f9af6c5abbfb08a6abf5c86bc7f3e1276badcadd437b2dc)

BibTeX

@misc{dcda3cd4170935,
  title = {Submodularity Is Barely Testable — arXiv:2611.02374},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02374},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_da3cd4170935; sha256 5d41e2401ca2c9ea6f9af6c5abbfb08a6abf5c86bc7f3e1276badcadd437b2dc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02374. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In 2010, Seshadhri and Vondrák asked: is submodularity testable? For functions $f : \{ 0, 1 \}^n \to \mathbb{R}$, they gave a tester that makes $2^{O(\sqrt{n} \log n)}$ queries. We show that every tester, even an adaptive one with two-sided error, must make $2^{\Omega(\sqrt{n})}$ queries, thereby concluding: submodularity is barely testable.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.02374 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:18:07.734Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).