Approximate counting of vertices of 0/1 polytopes: a stronger hardness result
Heng Guo, Mark Jerrum
Abstract
We show that approximately counting the vertices of a bounded 0/1 polytope, presented as a system of rational linear inequalities, is, informally speaking, NP-hard. In particular, there is no FPRAS for this problem unless RP=NP. The proof is by a reduction from approximately counting homomorphisms from a given graph to a particular four-vertex graph. The main proof ideas were found using GPT-5.6 Sol Ultra.
Create a lesson
Related papers
A Structural Proof of the Lower Bound 21 for 3×3 Matrix Multiplication over F2
Shuxing Yang, Rui Zhao, Junyao Wu et al.
An Operator Approach to Register Programs for Catalytic Computing
Antoine Vinciguerra
Rational Reductions and Regular Languages of Constant Circuit Complexity
Stefan Göller, Amaldev Manuel
Hidden Circuits and Exact Counting in Ordered Graphs
Chenghua Liu, Boning Meng
Improved lower bounds for decomposable randomized encoding
Justin Holmgren, Kewen Wu
Separating Non-redundancy and Chain Length
Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman