Paper by Erik D. Demaine

Reference:

Erik D. Demaine, William Gasarch, and Mohammad Hajiaghayi, “Computational Intractability: A Guide to Algorithmic Lower Bounds”, MIT Press, October 2026.

BibTeX

@Book{Hardness,
  AUTHOR        = {Erik D. Demaine and William Gasarch and Mohammad Hajiaghayi},
  TITLE         = {Computational Intractability: A Guide to Algorithmic Lower Bounds},
  PUBLISHER     = {MIT Press},
  MONTH         = {October},
  YEAR          = 2026,

  comments      = {See <A HREF="https://hardness.mit.edu/">our website</A> or
                   <A HREF="https://mitpress.mit.edu/9780262550772/computational-intractability/">the
                   publisher's webpage</A> for this book.
                   <A HREF="https://hardness.mit.edu/"><IMG ALIGN="MIDDLE" WIDTH="400" HEIGHT="510" SRC="cover.jpg"></A>},
  availability  = {Available for purchase from <A HREF="https://mitpress.mit.edu/9780262550772/computational-intractability/">the publisher</A> or <A HREF="https://www.amazon.com/dp/0262550776/">Amazon</A>.
                   See <A HREF="https://hardness.mit.edu/">our book website</A> for a downloadable draft.},
}

Comments:

See our website or the publisher's webpage for this book.

Availability:

Available for purchase from the publisher or Amazon. See our book website for a downloadable draft.

[Google Scholar search]