Reproduce “Approximate counting of vertices of 0/1 polytopes: a stronger hardness result” 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
Heng Guo, Mark Jerrum
The authors prove that counting vertices of bounded 0/1 polytopes described by rational inequalities has no FPRAS unless RP = NP. They reduce counting graph homomorphisms to a four-state graph by constructing a polytope whose vertices correspond exactly to those maps. This establishes hardness for the general class, while hardness under totally unimodular constraints remains open.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.