Computing & Cybersecurity

4441 tuit · page 110/112

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 23: Open problems

Ryan O'Donnell

July 8, 2017 76 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsFourier AnalysisOpen Problems

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 19: Invariance theorems

Ryan O'Donnell

July 8, 2017 77 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsInvariance PrincipleCentral Limit Theorem

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 17: UG-hardness results from dictator tests

John Wright

July 8, 2017 84 min

★ ★ ★ ★ ☆ 4/5

Unique Games ConjectureDictator TestingHardness of Approximation

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 16: Håstad's hardness theorems

Ryan O'Donnell

July 8, 2017 78 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsFourier AnalysisHardness of Approximation

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 15: Constraint satisfacation problems

Ryan O'Donnell

July 8, 2017 75 min

★ ★ ★ ★ ★ 5/5

Constraint SatisfactionBoolean FunctionsHardness of Approximation

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 14: Probabilistically checkable proofs of proximity

Ryan O'Donnell

July 8, 2017 76 min

★ ★ ★ ★ ★ 5/5

PCPProperty TestingBoolean Functions

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 13: Dictator Testing and the FKN Theorem

Ryan O'Donnell

July 8, 2017 77 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsFourier AnalysisProperty Testing

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 11: Level-1 inequality and the 2/pi Theorem

Ryan O'Donnell

July 8, 2017 79 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsFourier AnalysisLevel-1 Inequality

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 28: Why is P vs. NP Difficult?

Ryan O'Donnell

July 7, 2017 80 min

★ ★ ★ ★ ★ 5/5

P vs NPComputational ComplexityOracle Turing Machines

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 27: Hardness within P

Ryan O'Donnell

July 7, 2017 82 min

★ ★ ★ ★ ★ 5/5

Complexity TheorySETHHardness Within P

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 26: Beyond Worst-Case Analysis

Ryan O'Donnell

July 7, 2017 80 min

★ ★ ★ ★ ☆ 4/5

Complexity TheoryPCP TheoremExponential Time Hypothesis

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 25: Interactive Proofs: IP=PSPACE

Ryan O'Donnell

July 7, 2017 83 min

★ ★ ★ ★ ★ 5/5

Interactive ProofsComplexity TheoryIP=PSPACE

Formal & Physical Sciences Computing & Cybersecurity

Undergrad Complexity at CMU - Lecture 24: Oracle Turing Machines and P^NP

Ryan O'Donnell

July 7, 2017 82 min

★ ★ ★ ★ ★ 5/5

Computational ComplexityOracle Turing MachinesPolynomial Hierarchy

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 9: Majority, LTFs, and the CLT

Ryan O'Donnell

July 7, 2017 77 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsFourier AnalysisLinear Threshold Functions

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 8: Linial--Mansour--Nisan Theorems

Ryan O'Donnell

July 7, 2017 74 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsFourier AnalysisCircuit Complexity

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 7: DNF formulas

Ryan O'Donnell

July 7, 2017 75 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsDNFFourier Analysis

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 6: Restrictions and the Goldreich--Levin Theorem

Ryan O'Donnell

July 7, 2017 81 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsFourier AnalysisGoldreich-Levin Theorem

Formal & Physical Sciences Computing & Cybersecurity

Analysis of Boolean Functions at CMU - Lecture 5: Spectral concentration and learning

Ryan O'Donnell

July 7, 2017 80 min

★ ★ ★ ★ ★ 5/5

Boolean FunctionsFourier AnalysisLearning Theory

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

Applied Sciences & Engineering Computing & Cybersecurity

Steganography Tutorial - Hide Messages In Images

HackerSploit

June 27, 2017 10 min

★ ★ ★ ★ ☆ 4/5

SteganographyCybersecurityEthical Hacking

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