container

footer-menu-component

secondary-primary-menu

mega-menu

products

Marketing materials, training documents, discovery services

cengage:card

FIND YOUR SALES REPRESENTATIVE

cengage:column

Get marketing materials, training documents, discovery services.

PRODUCT SUPPORT

CUSTOMER SUPPORT

Report technical issues, errors, check system status

TECHNICAL SUPPORT

Manage product preferences, generate usage reports, simplify administrative tasks.

ADMIN TOOLS

support

cengage:galethorndikeseo

footer-social-menu-component

config

Browse by Institution Type

Browse by Product Type

Products

Support

zone1

secondary-storefront-menu

footer

Account Information

bundle-connector

International

North America

China

Japan

Latin America

Brazil

Region

Set your region:

gale-footer

zone3

FIND YOUR REP

support-order-2

header

footer-legal-menu

Terms of use

Privacy

header-component

footer-social-menu

Sign Up for Emails

CONNECT WITH GALE

Stay up-to-date with the latest Gale news, exclusive offers, and more.

facebook

linkedin

instagram

youtube

SOCIAL ICONS

footer-legal-menu-component

secondary-account-menu

Profile

Orders

Wish List

Fast Order Entry

My Account

footer-menu

Academic Institutions

K-12

Public Libraries

Government and Special Libraries

Statewide Programs

Institutions

Databases

Primary Sources

Digital Humanities Tools

eLearning

Schools/K-12 Curriculum

Books

Large Print Books by Thorndike Press

Find Your Rep

Product Support

Technical Support

Customer Support

Admin Tools

Accessibility Policy

About Us

Blogs

Press Center

Events

News

Careers

Partnerships

Contact Us

Our Company

Would you like to go to the Gale {{RECOMMENDED_COUNTRY}} site instead?

It looks like you're visiting from {{DETECTED_COUNTRY}}.

main

Request a Trial

You may already have access to Gale content through your institution.

STUDENTS AND RESEARCHERS

support-order-1

%1 products have been added to your cart but %2 have been backordered and will be fulfilled when stock is available

Product on backorder

Current quantity limit is [maxProductQuantity], please, navigate to the cart page and change quantity of product

You will be able to resubmit promo in ${countdown} seconds. test

Please note that the taxes displayed on our website are estimated and subject to adjustment. The actual tax charges will be determined and settled during the final invoicing of your order

product-detail-component

zone2

single-column

Information Technology

Computing & Information Technology

Gt Product Group

Binding Format

Marketing Imprint Name

B2B GT

CL Carton Count

Imprint Name

B2B & B2C

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.

People, Problems, and Proofs

POST SECONDARY FOUR YEAR

COLFR

COLJR

COLSO

COLSR

PEOPLE PROBLEMS AND PROOFS

Duration

Duration Unit Of Measure

Transaction Type

Front Cover.
Half Title Page.
Title Page.
Copyright Page.
Dedication.
Preface.
Contents.
1: The Claimant, the Readers, and the Crowd.
2: Kenneth Iverson: Notation and Thinking.
3: Edmund Hillary: Proofs and Mountain Climbing.
4: Leonardo da Vinci: Proofs as Art.
5: Michael Atiyah: The Role of Proof.
6: Subhash Khot: Unique Games Conjecture.
7: Arno Van Den Essen: An Amazing Conjecture.
8: Richard Hamilton: Group Efforts.
9: Grigori Perelman: A New Clay Problem.
10: Eric Allender: Solvable Groups.
11: Enrico Bombieri: On Intuition.
12: Fred Hennie: Lower Bounds.
13: Volker Strassen: Amazing Results.
14: Adam Smith: Dumb Channels.
15: Georg Cantor: Diagonal Method.
16: Raymond Smullyan: The Reals Are Uncountable.
17: William Tutte: Flow Problems.
18: Basil Rathbone: Writing a Major Result.
19: Elwyn Berlekamp: Dots and Boxes.
20: David Johnson: Galactic Algorithms.
21: Warren Hirsch: Guessing the Truth.
22: Shimon Even: A Promise Problem.
23: Matei David: Improving Noam Nisan&#x2019;s Generator.
24: Ryan Williams: A New Lower Bound.
25: Joel Seiferas: More on the New Lower Bound.
26: Victor Klee: Big Results.
27: George Dantzig: Equations, Equations, and Equations.
28: Srinivasa Ramanujan: The Role of Amateurs.
29: John Rhodes: Approaches to Problems.
30: John Nash: Connections.
31: Chee Yap: Computing Digits of &#x03C0;.
32: Henri Lebesgue: Projections Are Tricky.
33: Nina Balcan: A New Model of Complexity.
34: Sam Buss: Bounded Logic.
35: Anton Klyachko: Car Crashes.
36: Bernard Chazelle: Natural Algorithms.
37: Thomas Jech: The Axiom of Choice.
38: Alfonso Bedoya: Definitions, Definitions, and Definitions.
39: Hartley Rogers: Complexity Classes.
40: Ron Fagin: Second-Order Logic.
41: Daniel Lokshtanov: Knapsack Problem.
42: Albert Einstein: Beyond Polynomial Equations.
43: Denis Th&#x00E9;rien: Solvable Groups.
44: Andreas Bj&#x00F6;rklund: Hamiltonian Cycles.
45: David Hilbert: The Nullstellensatz.
46: John Hopcroft: Thinking out of the Box.
47: Dick Karp: The Polynomial Hierarchy.
48: Nick Howgrave-Graham and Antoine Joux: Attacking the Knapsack Problem.
49: Hedy Lamarr: The Role of Amateurs.
50: Nicolas Courtois: The Linearization Method.
51: Neal Koblitz: Attacks on Cryptosystems.
52: Richard Feynman: Miracle Numbers.
53: Patrick Fischer: Programming Turing Machines.
54: Roger Ap&#x00E9;ry: Explaining Proofs.
55: Ron Rivest: Mathematical Gifts.
56: Frank Ryan: The Quarterback Teaches.
57: Leonard Schulman: Associativity.
58: Paul Seymour: Graph Minors.
59: Alfred Tarski: Lower Bounds on Theories.
60: Ken Thompson: Playing Chess.
61: Virginia Vassilevska: Fixing Tournaments.
62: Arkadev Chattopadhyay: Computing Modulo Composites.
63: Charles Bennett: Quantum Protocols.

People, Problems, and Proofs.css-1p8rvzy{position:absolute;padding-left:8px;}

People, Problems, and Proofs