Reproduce “A composition theorem for randomized query complexity via max conflict complexity” 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
Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.