Great Moments of Theory at UC Berkeley (visit day edition)

Slides:

Advertisements

Similar presentations

December 2, 2009 IPAM: Invariance in Property Testing 1 Invariance in Property Testing Madhu Sudan Microsoft/MIT TexPoint fonts used in EMF. Read the TexPoint.

Advertisements

Parallel Repetition of Two Prover Games Ran Raz Weizmann Institute and IAS.

Time Complexity P vs NP.

What is theoretical computer science? Sanjeev Arora Princeton University Nov 2006.

Number Theory Algorithms and Cryptography Algorithms Prepared by John Reif, Ph.D. Analysis of Algorithms.

8/25/2009 Sofya Raskhodnikova Intro to Theory of Computation L ECTURE 1 Theory of Computation Course information Overview of the area Finite Automata Sofya.

Complexity Theory Lecture 1 Lecturer: Moni Naor. Computational Complexity Theory Study the resources needed to solve computational problems –Computer.

Graph Vertex Colorability & the Hardness Mengfei Cao COMP-150 Graph Theory Tufts University Dec. 15 th, Presentation for Final Project.

Depth through Breadth (or, why should we go to talks in other areas) Avi Wigderson IAS, Princeton.

Probabilistically Checkable Proofs (and inapproximability) Irit Dinur, Weizmann open day, May 1 st 2009.

Probabilistically Checkable Proofs Madhu Sudan MIT CSAIL 09/23/20091Probabilistic Checking of Proofs TexPoint fonts used in EMF. Read the TexPoint manual.

CS355 – The Mathematics and Theory of Computer Science Reductions.

PCPs and Inapproximability Introduction. My T. Thai 2 Why Approximation Algorithms  Problems that we cannot find an optimal solution.

Understanding Science Through the Lens of Computation Richard Karp Visit Day 2008.

Lecture 40 CSE 331 Dec 11, Announcements Solutions to HW 10 and graded HW 9 at end of the lecture Review session on Monday: see blog for details.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/4/01.

Learning and Fourier Analysis Grigory Yaroslavtsev CIS 625: Computational Learning Theory.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2005 Lecture 1 (Part 1) Introduction/Overview Tuesday, 1/25/05.

Testing the Diameter of Graphs Michal Parnas Dana Ron.

Design of Optimal Multiple Spaced Seeds for Homology Search Jinbo Xu School of Computer Science, University of Waterloo Joint work with D. Brown, M. Li.

Chapter 3 Coding Theory.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/3/02.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Review Lecture Tuesday, 12/10/02.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2004 Lecture 1 (Part 1) Introduction/Overview Wednesday, 9/8/04.

A Brief Introduction To The Theory of Computer Science and The PCP Theorem By Dana Moshkovitz Faculty of Mathematics and Computer Science The Weizmann.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2002 Lecture 1 (Part 1) Introduction/Overview Tuesday, 1/29/02.

1 Trends in Mathematics: How could they Change Education? László Lovász Eötvös Loránd University Budapest.

Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.

1 Mathematical Institute Serbian Academy of Sciences and Arts, Belgrade DEUKS Meeting Valencia, September 9-11, 2008, Valencia New PhD modules proposal.

1 Theory of Computation 計算理論 2 Instructor: 顏嗣鈞 Web: Time: 9:10-12:10 PM, Monday Place: BL 103.

Pseudorandomness Emanuele Viola Columbia University April 2008.

Major Disciplines in Computer Science Ken Nguyen Department of Information Technology Clayton State University.

My Favorite Ten Complexity Theorems of the Past Decade II Lance Fortnow University of Chicago.

Of 27 12/03/2015 Boole-Shannon: Laws of Communication of Thought 1 Laws of Communication of Thought? Madhu Sudan Harvard.

Probabilistically Checkable Proofs Madhu Sudan MIT CSAIL.

MIT Computer Science & Artificial Intelligence Laboratory 1 Research in Theoretical Computer Science Madhu Sudan CSAIL.

Nicholas Bulinski.  Informally it is the question of if a computer can quickly verify that a solution to a problem is true then can the computer solve.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Review Lecture Tuesday, 12/11/01.

Lecture 20 CSE 331 July 30, Longest path problem Given G, does there exist a simple path of length n-1 ?

Sub-fields of computer science. Sub-fields of computer science.

Richard Cleve DC 3524 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.

Theory of Computer Science

Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/9/08

Cryptography and Pseudorandomness

Why do we study Theory of Computation ?

Sublinear-Time Error-Correction and Error-Detection

Sublinear-Time Error-Correction and Error-Detection

Unsolvable Problems December 4, 2017.

Turing Award A note given in BCC class on March 7, 2017

Big Ideas in Computer Science

CS154, Lecture 18:.

Dana Moshkovitz The Institute For Advanced Study

Coin Flipping Protocol

Lance Fortnow NEC Research Institute

Intro to Theory of Computation

Christos H. Papadimitriou UC Berkeley

2nd Lecture: QMA & The local Hamiltonian problem

Local Error-Detection and Error-correction

My Favorite Ten Complexity Theorems of the Past Decade II

CAS CS 538 Cryptography.

Umans Complexity Theory Lectures

Beer Therapy Madhu Ralf Vote early, vote often

Introduction to PCP and Hardness of Approximation

Numerical Algorithms Quiz questions

Algorithmic Problems Related To The Internet

Richard Anderson Lecture 27 NP Completeness

Ideas to be Adopted from IUCEE Workshop on Teaching Algorithms

Turing Award A note given in BCC class on April 23, 2014

Theoretical Computer Science

Sofya Raskhodnikova; Intro Theory of Computation

Presentation transcript:

Great Moments of Theory at UC Berkeley (visit day edition) Christos H. Papadimitriou

Complexity Before NP-completeness: Switching and Automata Theory (Harrison) Space Complexity (Savitch-Cook) Blum Complexity P/NP-oriented automata theory (Cook) visit day

NP-completeness Cook, Levin, Karp [1971-2] Impact Basis for comprehensive methodology for attacking computational problems Open-ended paradigm in Complexity Ultimate variant: PCP (later…) visit day

Algorithms Strassen’s matrix multiplication (1969) Randomized algorithms (1970s) Karmarkar’s linear programming (1985) Parallel algorithms (1980s) Monte-Carlo algorithms (1990s – present) On-line algorithms (1990s) Combinatorial optimization (1970s – present) String matching algorithms and Bioinformatics (1980s –present) visit day

Cryptography Number theoretic complexity (Blum, Miller, Adleman, early 1970s) Public-Key Cryptography (1976) RSA (1978) Protocols (Blum 1980) Rigorous Cryptography (Blum, Goldwasser, Micali, Yao, 1982) visit day

Cryptography (cont.) Crypto/Complexity/Randomness (Blum - Micali, Yao 1982) Randomized encryption (Goldwasser-Micali 1982) Randomized algorithms (Karp-Luby 1983) Boosting randomness (Vazirani 1985, Zuckerman, 1989) visit day

…and finally: PCP Interactive protocols and proofs (1980s) Program testing (Blum 1989) Error-correcting codes (Berlekamp) Inapproximability Probabilistically checkable proofs (Arora, Feige, Goldwasser, Lund, Lovász, Motwani, Safra, Sudan, Szegedy 1990) visit day

CS and the Sciences Mathematics: P vs NP Physics: Quantum Computing (Vazirani) Physics: Phase Transitions (Sinclair) Biology: Computing the cell (Karp, Myers) Economics: The Internet as equilibrium (Papadimitriou) visit day

Why Berkeley? Record of past graduates Look around you Teaching at top schools Industry ACM dissertation awards Look around you Environment Atmosphere Colleagues visit day