Trading query complexity for sample-based testing and multi-testing scalability

DOI10.1109/FOCS.2015.75MaRDI QIDQ6946834zbMATH OpenFDO

Authors Oded Lachish, Yadu Vasudev, Eldar Fischer

Publication date 5 August 2025

Full work available at URL https://eprints.bbk.ac.uk/id/eprint/13240/1/Universal.pdf

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

Cited in

(1)

• Nearly optimal bounds for sample-based testing and learning of k-monotone functions

This page was built for publication: Trading query complexity for sample-based testing and multi-testing scalability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946834)