Reproduce “A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Shalev Ben-David, Eric Blais
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.