Блог пользователя cancaneed

Автор cancaneed, история, 8 дней назад, По-английски
  • Проголосовать: нравится
  • +17
  • Проголосовать: не нравится

»
8 дней назад, # |
  Проголосовать: нравится +5 Проголосовать: не нравится

It seems like a very constrained version of the "count integer points inside a polytope" problem. For fixed dimension there are polynomial solutions for it. See: A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension Is Fixed [AI Barvinok · 1994].

I don't know for sure, but possibly you can maybe simplify this paper a bit and just implement that. Still that seems really hard. I don't know if there's any easier ideas.