- Complexity Theory April 26, 2011
- Fast polynomial factorization, modular composition, and multipoint evaluation of multivariate polynomials
- CS 151 Complexity Theory Spring 2011 Problem Set 7
- CSE522/Math581EB Coding Theory Fall 2001 Lecture 10: November 8
- CS 151 Complexity Theory Spring 2011 Solution Set 4
- Complexity Theory May 19, 2011
- Complexity Theory May 5, 2011
- CSE522/Math581EB Coding Theory Fall 2001 Lecture 1: October 1
- Fast modular composition in any characteristic Kiran S. Kedlaya
- CS 151 Complexity Theory Spring 2011 Problem Set 4
- January 10, 2011 CS21 Lecture 4 1 Decidability and Tractability
- Complexity Theory May 12, 2011
- Pseudorandom generators and the BQP vs. PH problem Bill Fefferman
- CS 153 Current topics in theoretical computer science Spring 2010 Problem Set 2
- The Complexity of the Matroid-Greedoid Partition Problem
- CSE522/Math581EB Coding Theory Fall 2001 Lecture 6: October 25
- CSE522/Math581EB Coding Theory Fall 2001 Lecture 7: October 30
- Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms
- PseudoRandom Generators for All Hardnesses Christopher Umans
- On the Complexity of Approximating the VC dimension Elchanan Mossel
- CS 151 Complexity Theory Spring 2011 Solution Set 3
- CSE522/Math581EB Coding Theory Fall 2001 Lecture 8: November 1
- CSE522/Math581EB Coding Theory Fall 2001 Exercise 2: October 24
- CS 151 Complexity Theory Spring 2011 Solution Set 6
- CS 151 Complexity Theory Spring 2011 Solution Set 7
- Hardness of Approximating \Sigma p Minimization Problems
- March 2, 2011 CS21 Lecture 24 1 Decidability and Tractability
- January 14, 2011 CS21 Lecture 6 1 Decidability and Tractability
- CSE522/Math581EB Coding Theory Fall 2001 Exercise 1: October 9
- CS 153 Current Topics in Theoretical Computer Science Spring 2010 Solution Set 2
- January 28, 2011 CS21 Lecture 11 1 Decidability and Tractability
- CS 151 Complexity Theory Spring 2011 Problem Set 5
- An Algorithm for Finding Hamiltonian Cycles in Grid Graphs Without Holes
- CSE522/Math581EB Coding Theory Fall 2001 Lecture 11: November 13
- CS286C-02: Pseudorandomness and combinatorial constructions
- CSE522/Math581EB Coding Theory Fall 2001 Lecture 4: October 18
- Lossless Condensers, Unbalanced Expanders, and Amnon TaShma Christopher Umans y David Zuckerman z
- CS 21 Decidability and Tractability Winter 2011 Midterm Solutions
- March 7, 2011 CS21 Lecture 26 1 Decidability and Tractability
- February 7, 2011 CS21 Lecture 15 1 Decidability and Tractability
- On Sunflowers and Matrix Multiplication Amir Shpilka
- The complexity of Boolean formula minimization
- Reconstructive Dispersers and Hitting Set Generators
- Pseudorandomness for Approximate Counting and Sampling Ronen Shaltiel
- On the Complexity of Succinct Zero-Sum Games Lance Fortnow
- Complexity Theory March 29, 2011
- Complexity Theory March 31, 2011
- Complexity Theory April 12, 2011
- Complexity Theory April 21, 2011
- Complexity Theory May 3, 2011
- Complexity Theory May 10, 2011
- Complexity Theory May 17, 2011
- Complexity Theory May 24, 2011
- Complexity Theory May 26, 2011
- CS 151 Complexity Theory Spring 2011 Problem Set 1
- CS 151 Complexity Theory Spring 2011 Problem Set 3
- January 5, 2011 CS21 Lecture 2 1 Decidability and Tractability
- January 12, 2011 CS21 Lecture 5 1 Decidability and Tractability
- January 19, 2011 CS21 Lecture 7 1 Decidability and Tractability
- January 24, 2011 CS21 Lecture 9 1 Decidability and Tractability
- January 31, 2011 CS21 Lecture 12 1 Decidability and Tractability
- February 2, 2011 CS21 Lecture 13 1 Decidability and Tractability
- February 11, 2011 CS21 Lecture 17 1 Decidability and Tractability
- February 25, 2011 CS21 Lecture 22 1 Decidability and Tractability
- February 28, 2011 CS21 Lecture 23 1 Decidability and Tractability
- March 4, 2011 CS21 Lecture 25 1 Decidability and Tractability
- CS 21 Decidability and Tractability Winter 2011 Problem Set 1
- CS 21 Decidability and Tractability Winter 2011 Solution Set 1
- CS 21 Decidability and Tractability Winter 2011 Problem Set 2
- CS 21 Decidability and Tractability Winter 2011 Solution Set 2
- CS 21 Decidability and Tractability Winter 2010 Solution Set 3
- CS 21 Decidability and Tractability Winter 2011 Solution Set 4
- CS 21 Decidability and Tractability Winter 2011 Problem Set 5
- CS 21 Decidability and Tractability Winter 2011 Problem Set 6
- CS 21 Decidability and Tractability Winter 2011 Solution Set 6
- CS 21 Decidability and Tractability Winter 2011 Problem Set 7
- CS 9 Introduction to Computer Science Research Fall 2010 Course Summary and Syllabus
- CS 286A-2 Mathematical Methods in Theoretical Computer Science Fall 2008 Course Summary and Syllabus
- CSE522/Math581EB Coding Theory Fall 2001 Lecture 2: October 4
- On the Complexity and Inapproximability of Shortest Implicant Problems
- February 9, 2011 CS21 Lecture 16 1 Decidability and Tractability
- CS 21 Decidability and Tractability Winter 2011 Problem Set 4
- February 4, 2011 CS21 Lecture 14 1 Decidability and Tractability
- The Complexity of Rationalizing Matchings Shankar Kalyanaraman
- Complexity Theory April 28, 2011
- Complexity Theory April 14, 2011
- CS 151 Complexity Theory Spring 2011 Out: April 28 Due: May 5 at the beginning of class
- CS 21 Decidability and Tractability Winter 2011 Solution Set 7
- February 16, 2011 CS21 Lecture 19 1 Decidability and Tractability
- Better lossless condensers through derandomized curve samplers
- CS 153 Current topics in theoretical computer science Spring 2010 Problem Set 1
- January 26, 2011 CS21 Lecture 10 1 Decidability and Tractability
- February 18, 2011 CS21 Lecture 20 1 Decidability and Tractability
- CS 151 Complexity Theory Spring 2011 Solution Set 1
- CS 21 Decidability and Tractability Winter 2011 Solution Set 5
- CS 151 Complexity Theory Spring 2011 Midterm Solutions
- CS 151 Complexity Theory Spring 2011 Problem Set 2
- January 21, 2011 CS21 Lecture 8 1 Decidability and Tractability
- CS 153 Current topics in theoretical computer science Spring 2010 Solution Set 1
- Complexity Theory April 5, 2011
- February 14, 2011 CS21 Lecture 18 1 Decidability and Tractability
- Chris Umans January 26, 2000 Oce Hours: 3:00{5:00 Tuesdays and Thursdays in Soda 583
- CSE522/Math581EB Coding Theory Fall 2001 Lecture 3: October 9
- Approximability and Completeness in the Polynomial Hierarchy Christopher Matthew Umans
- January 7, 2011 CS21 Lecture 3 1 Decidability and Tractability
- CSE 522 / Math 581EB Coding Theory
- CSE522/Math581EB Coding Theory Fall 2001 Lecture 5: October 23
- CS 151 Complexity Theory Spring 2011 Problem Set 6
- CS 153 Current Topics in Theoretical Computer Science Spring 2010 Course Summary and Syllabus
- January 3, 2011 CS21 Lecture 1 1 Decidability and Tractability
- The Complexity of Rationalizing Network Formation Shankar Kalyanaraman
- CSE522/Math581EB Coding Theory Fall 2001 Lecture 12: November 20
- The Minimum Equivalent DNF Problem and Shortest Implicants Christopher Umans \Lambda
- Hamiltonian Cycles in Solid Grid Graphs (Extended Abstract)
- CS 151 Complexity Theory Spring 2011 Solution Set 5
- CS 21 Decidability and Tractability Winter 2011 Problem Set 3
- About this course CS 9: Introduction to CS Research
- CS21: Decidability and Tractability course information and tentative schedule
- February 23, 2011 CS21 Lecture 21 1 Decidability and Tractability
- Complexity Theory April 19, 2011
- CS 151 Complexity Theory Spring 2011 Solution Set 2
- Inapproximability for VCG-Based Combinatorial Auctions Dave Buchfuhrer
- CSE522/Math581EB Coding Theory Fall 2001 Exercise 3: November 13
- CSE522/Math581EB Coding Theory Fall 2001 Lecture 9: November 6
- March 9, 2011 CS21 Lecture 27 1 Decidability and Tractability
- Complexity Theory April 7, 2011
- CS 151 Complexity Theory Spring 2011 Course Summary and Syllabus
- CS9: Introduction to CS Research Make sure you pick up a cupcake & a syllabus on the way in.
- CS9: Lecture 6 Katrina Ligett
- On Sunflowers and Matrix Multiplication Amir Shpilka
- CS 9 Introduction to Computer Science Research Fall 2011 Course Summary and Syllabus
- On beating the hybrid argument [Extended Abstract]
- Theoretical Computer Science
