Timeline for Approximate volume computation and lattice point enumeration - hardness
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 16, 2017 at 4:27 | comment | added | Sasho Nikolov | Why is this knapsack? The special case where the polyhedron is a halfspace is the counting version of knapsack and for that there is an approximation scheme. But I don't see how to get the arbitrary polyhedron version from this. | |
| Oct 15, 2017 at 2:34 | history | answered | Igor Rivin | CC BY-SA 3.0 |