- CMPT 710 -Complexity Theory: Lecture 16 Valentine Kabanets
- Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
- CMPT 710 -Complexity Theory: Lecture 11 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 11 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 2 Valentine Kabanets
- CMPT 710 Complexity Theory: Week 13 Valentine Kabanets
- CMPT 308 Computability and Complexity Spring 2005
- CMPT 710 -Complexity Theory: Lecture 13 Valentine Kabanets
- Average Case Complexity March 17, 2011 Lecture 13: Random k-SAT -Continued
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 15: Simulating BPP High MinEntropy Sources
- CMPT 710 Complexity Theory: Lecture 16 Valentine Kabanets
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 10: Some Constructions of Expander Graphs
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 12: Weak Sources of Randomness and Extractors
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 1: Introduction and Overview
- CMPT 710 -Complexity Theory: Week 9 Valentine Kabanets
- Average Case Complexity March 17, 2011 Lecture 12: Random k-SAT
- CMPT 710 -Complexity Theory: Lecture 2 Valentine Kabanets
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 14: Extractors vs. Expanders
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 16: Generalization of Extractors
- CMPT 710 -Complexity Theory: Lecture 20 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 8 Valentine Kabanets
- CMPT 710 Complexity Theory: Week 1 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 9 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 4 Valentine Kabanets
- Circuit Minimization Problem Valentine Kabanets \Lambda JinYi Cai y
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 13: Extractors from Hashing
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 8: Spectral Expansion II
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 6: Random Walk on Graphs and Spectral Graph Theory
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 2: Randomized Algorithms
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 3: Power of Randomness
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 11: ZigZag products and Expanders
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 5: Random Walk on Graphs and Spectral Graph Theory
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 4: An application of Electrical Networks to USTCON
- CMPT 710 Complexity Theory: Lecture 7 Valentine Kabanets
- An Axiomatic Approach to Algebrization Russell Impagliazzo
- Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification
- Constructive Proofs of Concentration Bounds Russell Impagliazzo
- CMPT 710 -Complexity Theory: Lecture 21 Valentine Kabanets
- CMPT 710 -Complexity Theory: Week 2 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 20 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 16 Valentine Kabanets
- Average Case Complexity Jan 13, 2011 Lecture 3: Completeness for Average Case Complexity
- CMPT 710 -Complexity Theory: Lecture 23 Valentine Kabanets
- Average Case Complexity Jan 11, 2011 Lecture 2: Why Average Case Complexity?
- Average Case Complexity March 26, 2011 Lecture 5 : Average-Case Completeness
- CMPT 710 -Complexity Theory: Lecture 12 Valentine Kabanets
- Chernoff-type Direct Product Theorems Russell Impagliazzo
- Derandomization: A Brief Overview Valentine Kabanets \Lambda
- Average Case Complexity March 16, 2011 Impagliazzo's Five Worlds
- CMPT 710 -Complexity Theory: Lecture 22 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 22 Valentine Kabanets
- Kruskal's Algorithm: Correctness Analysis Valentine Kabanets
- CMPT 710 Complexity Theory: Week 12 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 8 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 20 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 14 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 19 Valentine Kabanets
- CMPT 710/CMPT 407 Computational Complexity Instructor: Valentine Kabanets, email: kabanets@cs.sfu.ca
- CMPT 710 Complexity Theory: Lecture 1 Valentine Kabanets
- Recognizability Equals Definability for Partial Valentine Kabanets
- CMPT 710 -Complexity Theory: Week 10 Valentine Kabanets
- Average Case Complexity March 10, 2011 Lecture 14: The random k-SAT and k-XORSAT solution space
- The Black-Box Query Complexity of Polynomial Department of Computer Science
- CMPT 710 Complexity Theory: Week 3 Valentine Kabanets
- Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
- CMPT 710 Complexity Theory: Lecture 14 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 13 Valentine Kabanets
- DERANDOMIZING POLYNOMIAL IDENTITY TESTS MEANS PROVING
- CMPT 710 Complexity Theory: Week 8 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 5 Valentine Kabanets
- CMPT 307 Solutions to Midterm #2 March 24, 2011 1. Suppose the runtime of an algorithm is T(n). Circle the expressions for T(n) below[6]
- CMPT 710 -Complexity Theory: Week 4 Valentine Kabanets
- Almost kWise Independence and Hard Boolean Functions ?
- Average Case Complexity Jan 25, 2011 Lecture 6: Samplable Distributions
- RECOGNIZABILITY EQUALS DEFINABILITY PARTIAL KPATHS
- CMPT 710/CMPT 407 -Computational Complexity Instructor: Valentine Kabanets, email: kabanets@cs.sfu.ca
- CMPT 710 Complexity Theory: Lecture 21 Valentine Kabanets
- CMPT 710 Complexity Theory: Week 10 Valentine Kabanets
- 1 A Greedy Algorithm for Scheduling Jobs with Deadlines and The setting is that we have n jobs, each of which takes unit time, and a processor on which we
- CMPT 710 -Complexity Theory: Week 3 Valentine Kabanets
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 3: Power of Randomness
- CMPT 710 -Complexity Theory: Week 13 Valentine Kabanets
- New Direct-Product Testers and 2-Query PCPs Russell Impagliazzo
- Expanders made elementary: A combinatorial analysis of an expander construction
- CMPT 710 -Complexity Theory: Lecture 7 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 10 Valentine Kabanets
- CMPT 710 Complexity Theory: Week 6 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 17 Valentine Kabanets
- CMPT 710 -Complexity Theory: Week 11 Valentine Kabanets
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 13: Extractors from Hashing
- Easiness Assumptions and Hardness Tests: Trading Time for Zero Error
- An Axiomatic Approach to Algebrization Russell Impagliazzo
- New Direct-Product Testers and 2-Query PCPs Russell Impagliazzo
- Security Amplification for Interactive Cryptographic Primitives
- Average Case Complexity Jan 27, 2011 Lecture 7: Samplable Distributions Continued
- Average Case Complexity February 8, 2011 Impagliazzo's Hardcore Lemma
- CMPT 710 -Complexity Theory: Lecture 1 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 3 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 4 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 5 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 6 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 7 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 8 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 9 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 11 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 12 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 15 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 17 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 22 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 24 Valentine Kabanets
- CMPT 710 -Complexity Theory: Week 5 Valentine Kabanets
- CMPT 710 -Complexity Theory: Week 6 Valentine Kabanets
- CMPT 710 -Complexity Theory: Week 7 Valentine Kabanets
- CMPT 710 -Complexity Theory: Week 12 Valentine Kabanets
- CMPT 308 -Computability and Complexity Spring 2005
- CMPT 710 -Complexity Theory: Lecture 1 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 4 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 5 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 6 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 9 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 14 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 17 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 19 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 21 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 2 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 18 Valentine Kabanets
- Chernoff-type Direct Product Theorems Russell Impagliazzo1
- Average Case Complexity February 10, 2011 Hardness Amplification: Yao's XOR Lemma
- Constructive Proofs of Concentration Bounds Russell Impagliazzo
- CMPT 710 -Computational Complexity Instructor: Valentine Kabanets, email: kabanets@cs.sfu.ca
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 8: Spectral Expansion II
- Derandomization: A Brief Overview # Valentine Kabanets +
- CMPT 710 Complexity Theory: Week 5 Valentine Kabanets
- CMPT 710 Complexity Theory: Week 7 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 6 Valentine Kabanets
- Average Case Complexity March 16, 2011 Security Amplification
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 10: Some Constructions of Expander Graphs
- Average Case Complexity March 8, 2011 Lecture 14: Random k-SAT : Second Moment Method
- CMPT 710 -Complexity Theory: Lecture 10 Valentine Kabanets
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 2: Randomized Algorithms
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 5: Random Walk on Graphs and Spectral Graph Theory
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 6: Random Walk on Graphs and Spectral Graph Theory
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 14: Extractors vs. Expanders
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 16: Generalization of Extractors
- Almost k-Wise Independence and Hard Boolean Functions Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 10 Valentine Kabanets
- CMPT 710 Complexity Theory: Week 9 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 3 Valentine Kabanets
- CMPT 710 Complexity Theory: Week 11 Valentine Kabanets
- CMPT 710 Complexity Theory: Week 4 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 12 Valentine Kabanets
- Easiness Assumptions and Hardness Tests: Trading Time for Zero Error
- CMPT 710 Computational Complexity Instructor: Valentine Kabanets, email: kabanets@cs.sfu.ca
- CMPT 710 Complexity Theory: Week 2 Valentine Kabanets
- CMPT 710 -Complexity Theory: Week 8 Valentine Kabanets
- In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
- CMPT 710 Complexity Theory: Lecture 15 Valentine Kabanets
- Nonuniformly Hard Boolean Functions Uniform Complexity Classes
- In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
- CMPT 710 -Complexity Theory: Lecture 17 Valentine Kabanets
- Uniform Hardness Amplification in NP via Monotone Codes
- CMPT 710 -Complexity Theory: Lecture 15 Valentine Kabanets
- CMPT 710 -Complexity Theory: Week 1 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 19 Valentine Kabanets
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 15: Simulating BPP -High Min-Entropy Sources
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 12: Weak Sources of Randomness and Extractors
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 11: ZigZag products and Expanders
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 4: An application of Electrical Networks to USTCON
- CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 1: Introduction and Overview
- Dynamic Programming Notes Spring 2011 Dynamic Programming Algorithms
- Average Case Complexity March 26, 2011 Lecture 4 : Average-Case Completeness
- CMPT 710 -Complexity Theory: Lecture 3 Valentine Kabanets
- CMPT 710 -Complexity Theory: Lecture 13 Valentine Kabanets
- CMPT 710 Complexity Theory: Lecture 17 Valentine Kabanets
- Based on the notes for the U of Toronto course CSC 364 Dynamic Programming Algorithms
