Huge multiway table problems

Research output: Contribution to journalArticlepeer-review


Optimization over l×m×n integer threeway tables is NP-hard already for fixed l=3, but solvable in polynomial time with both l,m fixed. Here we consider huge tables, where the variable dimension n is encoded in binary. Combining recent results on Graver bases and recent results on integer cones, we show how to handle such problems in polynomial time. We also show that a harder variant of the problem lies in both NP and coNP. Our treatment goes through the more general class of n-fold integer programming problems.

Original languageEnglish
Pages (from-to)72-77
Number of pages6
JournalDiscrete Optimization
StatePublished - Nov 2014


  • Graver basis
  • Integer cone
  • Integer programming
  • Multiway table

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Huge multiway table problems'. Together they form a unique fingerprint.

Cite this