2 citations · 2 across the 4 of their papers we have counts for
1 paper · 1 filter
Heng Guo, Mark Jerrum
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,…