Reproduce “Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth” 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
Eva Fluck, Tim Seppelt, Gian Luca Spitzer
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.