Reproduce “A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs” 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
Pasin Manurangsi, Prasad Raghavendra
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.