Skip to main content

All Questions

Filter by
Sorted by
Tagged with
10 votes
3 answers
985 views

Approximate volume computation and lattice point enumeration - hardness

Both volume computation and lattice point enumeration of convex polyhedron are $\#P$ hard. However there is a randomized polytime algorithm for constant factor approximation for volume computation. ...
Turbo's user avatar
  • 13.9k