Paper by Erik D. Demaine

Reference:

Erik D. Demaine, William Gasarch, and Mohammad Hajiaghayi, “Computational Intractability: A Guide to Algorithmic Lower Bounds”, MIT Press, 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},
  YEAR          = 2026,

  comments      = {See <A HREF="https://hardness.mit.edu/">the book website</A> for a downloadable draft. &nbsp;
                   <A HREF="https://hardness.mit.edu/"><IMG ALIGN="MIDDLE" WIDTH="400" HEIGHT="510" SRC="cover.jpg"></A>},
}

Comments:

See the book website for a downloadable draft.  

Availability:

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

[Google Scholar search]