rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: People, Problems, and Proofs
    sub title: Essays from Gödel's Lost Letter: 2010
  name:
    name part: Lipton, Richard J.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Regan, Kenneth W.
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2013
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVIII, 333 p. 33 illus., 5 illus. in color. online resource.
  abstract: People, problems, and proofs are the lifeblood of theoretical computer science. Behind the computing devices and applications that have transformed our lives are clever algorithms, and for every worthwhile algorithm there is a problem that it solves and a proof that it works. Before this proof there was an open problem: can one create an efficient algorithm to solve the computational problem? And, finally, behind these questions are the people who are excited about these fundamental issues in our computational world. In this book the authors draw on their outstanding research and teaching experience to showcase some key people and ideas in the domain of theoretical computer science, particularly in computational complexity and algorithms, and related mathematical topics. They show evidence of the considerable scholarship that supports this young field, and they balance an impressive breadth of topics with the depth necessary to reveal the power and the relevance of the work described. Beyond this, the authors discuss the sustained effort of their community, revealing much about the culture of their field. A career in theoretical computer science at the top level is a vocation: the work is hard, and in addition to the obvious requirements such as intellect and training, the vignettes in this book demonstrate the importance of human factors such as personality, instinct, creativity, ambition, tenacity, and luck. The authors' style is characterize d by personal observations, enthusiasm, and humor, and this book will be a source of inspiration and guidance for graduate students and researchers engaged with or planning careers in theoretical computer science.
  table of contents: The Claimant, the Readers, and the Crowd -- Kenneth Iverson: Notation and Thinking -- Edmund Hillary: Proofs and Mountain Climbing -- Leonardo da Vinci: Proofs as Art -- Michael Atiyah: The Role of Proof -- Subhash Khot: Unique Games Conjecture -- Arno van den Essen: An Amazing Conjecture -- Richard Hamilton: Group Efforts -- Grigori Perelman: A New Clay Problem -- Eric Allender: Solvable Groups -- Enrico Bombieri: On Intuition -- Fred Hennie: Lower Bounds -- Volker Strassen: Amazing Results -- Adam Smith: Dumb Channels -- Georg Cantor: Diagonal Method -- Raymond Smullyan: The Reals Are Uncountable -- William Tutte: Flow Problems -- Basil Rathbone: Writing a Major Result -- Elwyn Berlekamp: Dots And Boxes -- David Johnson: Galactic Algorithms -- Warren Hirsch: Guessing The Truth -- Shimon Even: A Promise Problem -- Matei David: Improving Noam Nisan’s Generator -- Ryan Williams: A New Lower Bound -- Joel Seiferas: More on the New Lower Bound -- Victor Klee: Big Results -- George Dantzig: Equations, Equations, and Equations -- Srinivasa Ramanujan: The Role of Amateurs -- John Rhodes: Approaches to Problems -- John Nash: Connections -- Chee Yap: Computing Digits of π -- Henri Lebesgue: Projections Are Tricky -- Nina Balcan: A New Model of Complexity -- Sam Buss: Bounded Logic -- Anton Klyachko: Car Crashes -- Bernard Chazelle: Natural Algorithms -- Thomas Jech: The Axiom of Choice -- Alfonso Bedoya: Definitions, Definitions, and Definitions -- Hartley Rogers: Complexity Classes -- Ron Fagin: Second Order Logic -- Daniel Lokshtanov: Knapsack Problem -- Albert Einstein: Beyond Polynomial Equations -- Denis Thérien: Solvable Groups -- Andreas Björklund: Hamiltonian Cycles -- David Hilbert: The Nullstellensatz -- John Hopcroft: Thinking out of the Box -- Dick Karp: The Polynomial Hierarchy -- Nick Howgrave-Graham and Antoine Joux: Attacking the Knapsack Problem -- Hedy Lamarr: The Role of Amateurs -- Nicolas Courtois: The Linearization Method -- Neal Koblitz: Attacks on Cr…
  note: by Richard J. Lipton, Kenneth W. Regan.
  subject:
    topic: Computer science
  subject:
    topic: Computers
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Mathematics
  subject:
    topic: History
  subject:
    topic: Computer Science
  subject:
    topic: Theory of Computation
  subject:
    topic: History of Computing
  subject:
    topic: Mathematics of Computing
  subject:
    topic: History of Mathematical Sciences
  classification: QA75.5-76.95
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  identifier: 9783642414220
  identifier: http://dx.doi.org/10.1007/978-3-642-41422-0
  record info:
    record creation date: 131209
    record change date: 20151204182410.0
    record identifier: 978-3-642-41422-0