Mathematical theory of computation

Thema UYA

186 tuit · page 5/5

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 4: Noise stability and Arrow's Theorem

Ryan O'Donnell

July 7, 2017 81 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsNoise StabilityFourier Analysis

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 3: Social choice and influences

Ryan O'Donnell

July 7, 2017 77 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsSocial ChoiceInfluence

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 2: Probability densities and BLR linearity testing

Ryan O'Donnell

July 7, 2017 72 min

★ ★ ★ ★ ★ 5/5

Analysis of Boolean FunctionsFourier AnalysisProbability Densities

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 10: LTFs and noise stability

Ryan O'Donnell

July 7, 2017 78 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsFourier AnalysisNoise Stability

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 1: The Fourier expansion and basic formulas

Ryan O'Donnell

July 7, 2017 71 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsFourier AnalysisHarmonic Analysis

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 23: The Polynomial Hierarchy

Anil Ada

July 3, 2017 77 min

★ ★ ★ ★ ☆ 4/5

Complexity TheoryPolynomial HierarchyNP

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 22: BPP

Venkatesan Guruswami

July 3, 2017 79 min

★ ★ ★ ★ ★ 5/5

BPPRandomized AlgorithmsComplexity Theory

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 21: Randomized Complexity: RP, coRP, and ZPP

Ryan O'Donnell

July 3, 2017 81 min

★ ★ ★ ★ ☆ 4/5

Randomized AlgorithmsComplexity ClassesRP

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 20: The Immerman--Szelepcsényi Theorem

Ryan O'Donnell

July 3, 2017 81 min

★ ★ ★ ★ ★ 5/5

Complexity TheoryImmerman-SzelepcsényiNL=coNL

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 19: From P-Completeness to PSPACE-Completeness

Ryan O'Donnell

July 3, 2017 79 min

★ ★ ★ ★ ★ 5/5

Complexity TheoryP-CompletenessPSPACE-Completeness

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 18: NL-Completeness and Logspace Reductions

Ryan O'Donnell

July 3, 2017 80 min

★ ★ ★ ★ ★ 5/5

Computational ComplexityNL-CompletenessLogspace Reductions

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 17: Savitch's Theorem and NL

Ryan O'Donnell

July 3, 2017 81 min

★ ★ ★ ★ ★ 5/5

Complexity TheorySavitch's TheoremNL

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 16: Space Complexity

Ryan O'Donnell

July 3, 2017 81 min

★ ★ ★ ★ ★ 5/5

Space ComplexityTuring MachinesComplexity Classes

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 15: coNP

Ryan O'Donnell

July 3, 2017 81 min

★ ★ ★ ★ ★ 5/5

CoNPComplexity TheoryNP

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 9: Nondeterminism

Ryan O'Donnell

June 24, 2017 81 min

★ ★ ★ ★ ☆ 4/5

NondeterminismComplexity TheoryNP

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 8: NP

Ryan O'Donnell

June 24, 2017 81 min

★ ★ ★ ★ ★ 5/5

NPComputational ComplexityP vs NP

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 7: SAT

Ryan O'Donnell

June 24, 2017 80 min

★ ★ ★ ★ ☆ 4/5

SATComplexity TheoryNP-Completeness

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 6: Problems in P

Ryan O'Donnell

June 24, 2017 81 min

★ ★ ★ ★ ★ 5/5

Complexity TheoryPPolynomial Time

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 5: Time Hierarchy Theorem

Ryan O'Donnell

June 24, 2017 80 min

★ ★ ★ ★ ★ 5/5

Time Hierarchy TheoremComputational ComplexityTuring Machines

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 4: Time Complexity and Universal Turing Machines

Ryan O'Donnell

June 24, 2017 77 min

★ ★ ★ ★ ★ 5/5

Complexity TheoryTime ComplexityTuring Machines

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 14: Ladner's Theorem and Mahaney's Theorem

Ryan O'Donnell

June 24, 2017 82 min

★ ★ ★ ★ ★ 5/5

Computational ComplexityLadner's TheoremMahaney's Theorem

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 13: Search-to-Decision, Padding, Dichotomy Theorems

Ryan O'Donnell

June 24, 2017 79 min

★ ★ ★ ★ ☆ 4/5

Computational ComplexitySearch-to-DecisionPadding

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 12: NP-Completeness Reductions

David Witmer

June 24, 2017 80 min

★ ★ ★ ★ ☆ 4/5

NP-CompletenessReductions3SAT

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 3: Simulations and Turing Machine Variants

Ryan O'Donnell

June 11, 2017 80 min

★ ★ ★ ★ ★ 5/5

Turing MachinesComputational ComplexitySimulation

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 2: Turing Machines

Ryan O'Donnell

June 11, 2017 79 min

★ ★ ★ ★ ★ 5/5

Turing MachinesComputational ComplexityTheory of Computation

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 1: Course Overview

Ryan O'Donnell

June 7, 2017 79 min

★ ★ ★ ★ ☆ 4/5

Complexity TheoryP vs NPComputational Complexity