Many readers will be familiar with the Computational Complexity blog, started in 2003 by Lance Fortnow and, since 2007, co-blogged by Bill Gasarch. Professor Gasarch is also the first author of Problems with a Point, which is based on 24 of Gasarch's Computational Complexity blog posts, most of them significantly expanded or reworked with contributions from co-author Clyde Kruskal. The book presents us with 24 stories, problems, or theorems ?with a point." Indeed, most chapters have an opening subsection with the pleasingly succinct title ?Point," in which the point of the chapter is summarized, implicitly justifying the selection of the corresponding blog post for inclusion in the book. The Computational Complexity blog is known for the surprisingly wide ambit of its topics (officially ?fun stuff in math and computer science"). This breadth is reflected in the book, which features chapters on a variety of topics, including: the usage of mathematical terms in mainstream publications; what makes a good math competition problem?; what makes a math problem interesting?; what constitutes an elegant proof?; discussion of natural (?sane") reductions; and some healthy lessons about when and how to apply mathematical skepticism and intuition. The accessibility of the selection is admirable: most chapters can be appreciated by a strong high school mathematician, while a few require elementary knowledge of complexity or computability theory.
Read full abstract