Timeline for Why cannot we adapt Barvinok type counting techniques to general convex integer programs?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 5 at 11:48 | comment | added | Timothy Chow | Not sure exactly what you're asking. Higher-degree polynomials are a lot harder to handle than linear polynomials. Even in two dimensions, we have Pick's formula for a polygon, but even counting the exact number of integer points inside a circle is not a trivial problem. | |
| Sep 5 at 10:49 | history | edited | Turbo | CC BY-SA 4.0 |
added 1 character in body
|
| Sep 4 at 22:51 | history | edited | Turbo | CC BY-SA 4.0 |
added 119 characters in body
|
| Sep 4 at 14:45 | history | edited | Turbo | CC BY-SA 4.0 |
edited title
|
| Sep 3 at 20:16 | history | asked | Turbo | CC BY-SA 4.0 |