Paper by Erik D. Demaine

Reference:

Brynmor Chapman, Lily Chung, Erik D. Demaine, Yota Irino, Della Hendrickson, Tonan Kamata, and Ryuhei Uehara, “A Bookworm Climbs up the Polynomial Hierarchy: Meta-Restoration Complexity in Arithmetic Puzzles”, in Proceedings of the 13th International Conference on Fun with Algorithms (FUN 2026), edited by John Iacono, LIPIcs, volume 366, Porquerolles, France, May 18–22, 2026, 12:1–12:15.

BibTeX

@InProceedings{Bookworm_FUN2026,
  AUTHOR        = {Brynmor Chapman and Lily Chung and Erik D. Demaine and Yota Irino and Della Hendrickson and Tonan Kamata and Ryuhei Uehara},
  TITLE         = {A Bookworm Climbs up the Polynomial Hierarchy: Meta-Restoration Complexity in Arithmetic Puzzles},
  BOOKTITLE     = {Proceedings of the 13th International Conference on Fun with Algorithms (FUN 2026)},
  bookurl       = {https://fun2026.limos.fr/},
  EDITOR        = {John Iacono},
  SERIES        = {LIPIcs},
  VOLUME        = 366,
  ADDRESS       = {Porquerolles, France},
  MONTH         = {May 18--22},
  YEAR          = 2026,
  PAGES         = {12:1--12:15},

  withstudent   = 1,
  length        = {15 pages},
  doi           = {https://dx.doi.org/10.4230/LIPIcs.FUN.2026.12},
  dblp          = {https://dblp.org/rec/conf/fun/ChapmanCDIHKU26},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.4230/LIPIcs.FUN.2026.12">LIPIcs</A>.},
}

Comments:

This paper is also available from LIPIcs.

Length:

The paper is 15 pages.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]