Bücher von Richard J. Lipton

This book offers insights into theoretical computer science and mathematics, distilling complex topics into manageable essays that summarize and explain key developments, historical context, and future directions of complexity, computability and algorithms.

The P=NP question is one of the great problems of science, which has intrigued computer scientists and mathematicians for decades. This guide, originating from a weblog written by the author, covers historical developments and latest approaches to the problem.