Reproduce “New Algorithms and Hardness Results for Robust Satisfiability of (Promise) 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

Joshua Brakensiek, Lorenzo Ciardo, Venkatesan Guruswami, Aaron Potechin, Stanislav Živný

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