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...
| Κύριοι συγγραφείς: | , |
|---|---|
| Συγγραφή απο Οργανισμό/Αρχή: | |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2013.
|
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.
