The P=NP Question and Gödel’s Lost Letter

  • Richard J. Lipton

Table of contents

  1. Front Matter
    Pages 1-13
  2. A Prologue

    1. Front Matter
      Pages 1-1
    2. Richard J. Lipton
      Pages 3-5
  3. On the P=NP Question

    1. Front Matter
      Pages 7-7
    2. Richard J. Lipton
      Pages 9-11
    3. Richard J. Lipton
      Pages 13-17
    4. Richard J. Lipton
      Pages 19-21
    5. Richard J. Lipton
      Pages 23-26
    6. Richard J. Lipton
      Pages 27-28
    7. Richard J. Lipton
      Pages 29-31
    8. Richard J. Lipton
      Pages 33-36
    9. Richard J. Lipton
      Pages 37-38
    10. Richard J. Lipton
      Pages 39-41
    11. Richard J. Lipton
      Pages 43-48
    12. Richard J. Lipton
      Pages 49-53
    13. Richard J. Lipton
      Pages 55-60
    14. Richard J. Lipton
      Pages 61-65
    15. Richard J. Lipton
      Pages 67-70
    16. Richard J. Lipton
      Pages 71-75
    17. Richard J. Lipton
      Pages 77-80

About this book

Introduction

The P=NP question is one of the great problems of science, which has intrigued computer scientists and mathematicians for decades. Despite the abundant research in theoretical computer science regarding the P=NP question, it has not been solved.

The P=NP Question and Gödel’s Lost Letter covers historical developments (including the Gödel’s Lost letter), the importance of P=NP and the future of P=NP. This guide is also based on a new blog by the author, located at http://rjlipton.wordpress.com. Jin-Yi Cai, a professor in computer science at the University of Wisconsin remarks 'I think it is the single most interesting web blog I have seen on related topics. He has a great insight and wit and beautiful way to see things and explain them.' Richard DeMillo, a professor in computer science at Georgia Tech remarks, 'This is a much needed treatment of great open problem computing.'

The P=NP Question and Gödel’s Lost Letter is designed for advanced level students and researchers in computer science, and mathematics as a secondary text and reference book. Computer programmers, software developers and IT professionals working in the related industry of computer science theory, will also find this guide a valuable asset.

Keywords

Counting Finite P=NP algorithm currentjm mathematics notation problem programming proof theorem

Authors and affiliations

  • Richard J. Lipton
    • 1
  1. 1., College of ComputingGeorgia Institute of TechnologyAtlantaUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4419-7155-5
  • Copyright Information Springer Science+Business Media, LLC 2010
  • Publisher Name Springer, Boston, MA
  • eBook Packages Computer Science
  • Print ISBN 978-1-4419-7154-8
  • Online ISBN 978-1-4419-7155-5
  • About this book