Reproduce “Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters” 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
Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Paweł Rzążewski
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.