Reproduce “Robust algorithms with polynomial loss for near-unanimity 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

Víctor Dalmau, Marcin Kozik, Andrei Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Opršal

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