Paper by Erik D. Demaine

Reference:

MIT Hardness Grp., Josh Brunner, Andy Tockman, Frederick Stock, Della Hendrickson, Hayashi Layers, Timothy Gomez, Erik D. Demaine, and Jenny Diomidova, “Hardness Table Layout Hardness Table”, in Proceedings of SIGTBD (SIGTBD 2025), April 18, 2025.

BibTeX

@InProceedings{HardnessTables_SIGTBD2025,
  AUTHOR        = {MIT Hardness Grp. and Josh Brunner and Andy Tockman and Frederick Stock and Della Hendrickson and Hayashi Layers and Timothy Gomez and Erik D. Demaine and Jenny Diomidova},
  TITLE         = {Hardness Table Layout Hardness Table},
  BOOKTITLE     = {Proceedings of SIGTBD (SIGTBD 2025)},
  bookurl       = {http://sigtbd.csail.mit.edu/},
  MONTH         = {April 18},
  YEAR          = 2025,

  unrefereed    = 1,
  length        = {9 pages},
  withstudent   = 1,
  comments      = {Authors are ordered by number of vowels. See <a href="https://65440-2023.github.io/hyper-table/">an open-source interactive web app</a>, which can generate the tables from this paper.},
}

Abstract:

We analyze the complexity of summarizing given results into a table, organized by various parameters possibly constrained in order, to optimize various objectives. Our results include polynomial-, pseudopolynomial-, constant-, and zero-time algorithms; and NP- and coNP-hardness.

Comments:

Authors are ordered by number of vowels. See an open-source interactive web app, which can generate the tables from this paper.

Length:

The paper is 9 pages.

Availability:

The paper is available in PDF (2356k).

See information on file formats.

[Google Scholar search]