Reproduce “Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure” 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

Matthew Brennan, Guy Bresler, Wasim Huleihel

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.