People, Problems, and Proofs Essays from Gödel's Lost Letter: 2010 /
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...
| Published in: | Springer eBooks |
|---|---|
| Main Authors: | , |
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2013.
|
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1007/978-3-642-41422-0 Перейти в каталог НБ ТГУ |
| LEADER | 06098nam a22005055i 4500 | ||
|---|---|---|---|
| 001 | vtls000485416 | ||
| 003 | RU-ToGU | ||
| 005 | 20210922065834.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 140715s2013 gw | s |||| 0|eng d | ||
| 020 | |a 9783642414220 |9 978-3-642-41422-0 | ||
| 024 | 7 | |a 10.1007/978-3-642-41422-0 |2 doi | |
| 035 | |a to000485416 | ||
| 039 | 9 | |y 201407151956 |z Александр Эльверович Гилязов | |
| 040 | |a Springer |c Springer |d RU-ToGU | ||
| 050 | 4 | |a QA75.5-76.95 | |
| 072 | 7 | |a UY |2 bicssc | |
| 072 | 7 | |a UYA |2 bicssc | |
| 072 | 7 | |a COM014000 |2 bisacsh | |
| 072 | 7 | |a COM031000 |2 bisacsh | |
| 082 | 0 | 4 | |a 004.0151 |2 23 |
| 100 | 1 | |a Lipton, Richard J. |e author. |9 414824 | |
| 245 | 1 | 0 | |a People, Problems, and Proofs |h [electronic resource] : |b Essays from Gödel's Lost Letter: 2010 / |c by Richard J. Lipton, Kenneth W. Regan. |
| 260 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg : |b Imprint: Springer, |c 2013. |9 742158 | ||
| 300 | |a XVIII, 333 p. 33 illus., 5 illus. in color. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 505 | 0 | |a 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 Crypto-systems -- Richard Feynman: Miracle Numbers -- Patrick Fischer: Programming Turing Machines -- Roger Apéry: Explaining Proofs -- Ron Rivest: Mathematical Gifts -- Frank Ryan: The Quarterback Teaches -- Leonard Schulman: Associativity -- Paul Seymour: Graph Minors -- Alfred Tarski: Lower Bounds on Theories -- Ken Thompson: Playing Chess -- Virginia Vassilevska: Fixing Tournaments -- Arkadev Chattopadhyay: Computing Modulo Composites -- Charles Bennett: Quantum Protocols. | |
| 520 | |a 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 characterized 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. | ||
| 650 | 0 | |a Computer Science. |9 155490 | |
| 650 | 0 | |a Information theory. |9 303504 | |
| 650 | 1 | 4 | |a Computer Science. |9 155490 |
| 650 | 2 | 4 | |a Theory of Computation. |9 303507 |
| 650 | 2 | 4 | |a History of Computing. |9 304593 |
| 650 | 2 | 4 | |a Mathematics of Computing. |9 303612 |
| 650 | 2 | 4 | |a History of Mathematical Sciences. |9 296777 |
| 700 | 1 | |a Regan, Kenneth W. |e author. |9 414825 | |
| 710 | 2 | |a SpringerLink (Online service) |9 143950 | |
| 773 | 0 | |t Springer eBooks | |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1007/978-3-642-41422-0 |
| 856 | |y Перейти в каталог НБ ТГУ |u https://koha.lib.tsu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=356937 | ||
| 912 | |a ZDB-2-SCS | ||
| 950 | |a Computer Science (Springer-11645) | ||
| 999 | |c 356937 |d 356937 | ||