Reproduce “TFNP in the Random Oracle Model” 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

Noah Fleming, Mika Göös, Ziyi Guan, Oliver Korten, Daniel Mitropolsky, Toniann Pitassi, Artur Riazanov, Dmitry Sokolov and 2 more

The authors study average-case query hardness for total search problems in the random oracle model. They construct a PPAD problem that is hard for shallow decision trees by combining a hypergraph search with a counting argument guaranteeing a solution. In contrast, they give UEoPL a polynomial-query black-box solver, establishing a query-model distinction rather than a running-time result.

Summary by alphaXiv.

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