Reproduce “Permutation Code Equivalence is not Harder than Graph Isomorphism when Hulls are Trivial” 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
Magali Bardet, Ayoub Otmani, Mohamed Saeed-Taha
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.