Канал: Abrahim Ladha

CS4510 L20A Polynomial Time Hierarchy

CS4510 L20A Polynomial Time Hierarchy

CS4510 L20B Karp-Lipton Theorems

CS4510 L20B Karp-Lipton Theorems

CS2050 L31 Bayes' Theorem

CS2050 L31 Bayes' Theorem

CS4510 L19B Circuit Lower Bounds

CS4510 L19B Circuit Lower Bounds

CS4510 L19A Circuit Complexity

CS4510 L19A Circuit Complexity

CS2050 L30 Probability Applications and Expectation

CS2050 L30 Probability Applications and Expectation

CS2050 L29 Finite Probability Theory

CS2050 L29 Finite Probability Theory

CS4510 L18B Relativization

CS4510 L18B Relativization

CS4510 L18A Hierarchy Theorems

CS4510 L18A Hierarchy Theorems

CS2050 L28 Even More Pigeonhole

CS2050 L28 Even More Pigeonhole

CS4510 L17B PSPACE-completeness

CS4510 L17B PSPACE-completeness

CS4510 L17A Savitch's Theorem

CS4510 L17A Savitch's Theorem

CS2050 L27 Generalized Pigeonhole Principle

CS2050 L27 Generalized Pigeonhole Principle

CS2050 L26 Pigeonhole Principle

CS2050 L26 Pigeonhole Principle

CS4510 L16B Ladner's Theorem

CS4510 L16B Ladner's Theorem

CS4510 L16A Cook-Levin Theorem

CS4510 L16A Cook-Levin Theorem

CS2050 L25 Stars and Bars

CS2050 L25 Stars and Bars

CS4510 L15B Nondeterministic Polynomial Time

CS4510 L15B Nondeterministic Polynomial Time

CS4510 L15A Computational Complexity

CS4510 L15A Computational Complexity

CS2050 L24 Permutations, Combinations, Binomial Theorem

CS2050 L24 Permutations, Combinations, Binomial Theorem

CS2050 L23 Sum and Product Rule

CS2050 L23 Sum and Product Rule

CS4510 L14B Kolmogorov Complexity

CS4510 L14B Kolmogorov Complexity

CS4510 L14A The Recursion Theorem

CS4510 L14A The Recursion Theorem

CS2050 L22 Even More Induction

CS2050 L22 Even More Induction

CS4510 L13B Rice's Theorem, Post's Correspondence Problem

CS4510 L13B Rice's Theorem, Post's Correspondence Problem

CS4510 L13A Art of Reduction

CS4510 L13A Art of Reduction

CS2050 L21 Strong Induction

CS2050 L21 Strong Induction

CS2050 L20 Proof By Induction

CS2050 L20 Proof By Induction

CS4510 L12B The Halting Problem

CS4510 L12B The Halting Problem

CS4510 L12A Godel Incompleteness

CS4510 L12A Godel Incompleteness

CS2050 L19 RSA Cryptography

CS2050 L19 RSA Cryptography

CS4510 L11B Russell's Paradox

CS4510 L11B Russell's Paradox

CS4510 L11A Foundations of Mathematics

CS4510 L11A Foundations of Mathematics

CS2050 L18 Chinese Remainder Theorem

CS2050 L18 Chinese Remainder Theorem

CS2050 L17 Fermat's Little Theorem and Euler's Theorem

CS2050 L17 Fermat's Little Theorem and Euler's Theorem

CS4510 L10B Diagonalization

CS4510 L10B Diagonalization

CS4510 L10A Countability

CS4510 L10A Countability

CS2050 L16 Bezout's Identity and Group Theory

CS2050 L16 Bezout's Identity and Group Theory

CS4510 L09B Turing-completeness

CS4510 L09B Turing-completeness

CS4510 L09A Simulation

CS4510 L09A Simulation

CS2050 L15 GCD and LCM

CS2050 L15 GCD and LCM

CS2050 L14 Elementary Number Theory

CS2050 L14 Elementary Number Theory

CS4510 L08B Church-Turing Thesis

CS4510 L08B Church-Turing Thesis

CS4510 L08A Turing Machines

CS4510 L08A Turing Machines

CS2050 L13 Basis Representation Theorem

CS2050 L13 Basis Representation Theorem

CS4510 L07B Pumping Context-Free Languages

CS4510 L07B Pumping Context-Free Languages

CS4510 L07A Every PDA has a CFG

CS4510 L07A Every PDA has a CFG

CS2050 L12 Big O Notation

CS2050 L12 Big O Notation

CS2050 L11 Functions

CS2050 L11 Functions

CS4510 L06B Every CFG has a PDA

CS4510 L06B Every CFG has a PDA

CS4510 L06A Pushdown Automata

CS4510 L06A Pushdown Automata

CS2050 L10 More Set Theory

CS2050 L10 More Set Theory

CS4510 L05B Chomsky Normal Form

CS4510 L05B Chomsky Normal Form

CS4510 L05A Syntactic Structures

CS4510 L05A Syntactic Structures

CS2050 L9 Set Operations

CS2050 L9 Set Operations

CS2050 L8 Elementary Set Theory

CS2050 L8 Elementary Set Theory

CS4510 L04B Regular Grammars and Closure

CS4510 L04B Regular Grammars and Closure

CS4510 L04A Context-Free Grammars

CS4510 L04A Context-Free Grammars

CS2050 L7 More on Proof

CS2050 L7 More on Proof

CS4510 L03B The Pumping Lemma for Regular Languages

CS4510 L03B The Pumping Lemma for Regular Languages

CS4510 L03A Regular Expressions

CS4510 L03A Regular Expressions

CS2050 L6 Proof by Cases and Contradiction

CS2050 L6 Proof by Cases and Contradiction

CS2050 L5 Introduction to Proof

CS2050 L5 Introduction to Proof

CS4510 L02B Powerset Construction

CS4510 L02B Powerset Construction

CS4510 L02A Nondeterminism

CS4510 L02A Nondeterminism

CS2050 L4 Inference

CS2050 L4 Inference

CS2050 L3 Predicates and Quantifiers

CS2050 L3 Predicates and Quantifiers

CS4510 L01B Deterministic Finite Automata

CS4510 L01B Deterministic Finite Automata

CS4510 L01A Introduction

CS4510 L01A Introduction

CS2050 L2 Propositional Logic

CS2050 L2 Propositional Logic

CS2050 L1 Introduction, Why Logic?

CS2050 L1 Introduction, Why Logic?

CS3510 L19 Simplex and Duality

CS3510 L19 Simplex and Duality

CS3510 L18 Linear Programming (99% AUDIO)

CS3510 L18 Linear Programming (99% AUDIO)

CS3510 L17 Max Flow Min Cut Theorem

CS3510 L17 Max Flow Min Cut Theorem

CS3510 L16 Subset Sum and Knapsack (NO AUDIO)

CS3510 L16 Subset Sum and Knapsack (NO AUDIO)

CS3510 L15 Independent Set, Clique, and Vertex Cover

CS3510 L15 Independent Set, Clique, and Vertex Cover

CS3510 L14 Satisfiability

CS3510 L14 Satisfiability

CS3510 L13 NP-completeness

CS3510 L13 NP-completeness

CS3510 L12 Knapsack

CS3510 L12 Knapsack

CS3510 L11 Chain Matrix Multiplication

CS3510 L11 Chain Matrix Multiplication

CS3510 L10 Longest Sequences

CS3510 L10 Longest Sequences

CS3510 L9 Dynamic Programming

CS3510 L9 Dynamic Programming

CS3510 L8 Bellman-Ford and Floyd-Warshall

CS3510 L8 Bellman-Ford and Floyd-Warshall

CS3510 L7 Kruskal's Algorithm

CS3510 L7 Kruskal's Algorithm

CS3510 L6 BFS and Dijkstra's Algorithm

CS3510 L6 BFS and Dijkstra's Algorithm

CS 3510 L5 Depth First Search (NO AUDIO)

CS 3510 L5 Depth First Search (NO AUDIO)

CS 3510 L4 Cryptography

CS 3510 L4 Cryptography

CS3510 L3 Arithmetic NO AUDIO

CS3510 L3 Arithmetic NO AUDIO

CS3510 L2 Master Theorem and Mergesort

CS3510 L2 Master Theorem and Mergesort

CS3510 L1 Fibonacci and Big O NO AUDIO

CS3510 L1 Fibonacci and Big O NO AUDIO

CS4510 L20B Karp-Lipton Theorem

CS4510 L20B Karp-Lipton Theorem

CS4510 L20A The Polynomial Hierarchy

CS4510 L20A The Polynomial Hierarchy

CS4510 L19B Circuit Lower Bounds

CS4510 L19B Circuit Lower Bounds

CS4510 L19A Circuit Complexity

CS4510 L19A Circuit Complexity

CS4510 L18B Relativization

CS4510 L18B Relativization

CS4510 L18A Hierarchy Theorems

CS4510 L18A Hierarchy Theorems

CS4510 L17B PSPACE-completeness

CS4510 L17B PSPACE-completeness

CS4510 L17A Savitch's Theorem

CS4510 L17A Savitch's Theorem

CS4510 L16B Ladner's Theorem

CS4510 L16B Ladner's Theorem

CS4510 L16A Cook-Levin Theorem

CS4510 L16A Cook-Levin Theorem

CS4510 L15B Nondeterministic Polynomial Time

CS4510 L15B Nondeterministic Polynomial Time

CS4510 L15A Computational Complexity

CS4510 L15A Computational Complexity

CS4510 L14B Kolmogorov Complexity

CS4510 L14B Kolmogorov Complexity

CS4510 L14A The Recursion Theorem

CS4510 L14A The Recursion Theorem

CS4510 L13B Rice's Theorem and PCP

CS4510 L13B Rice's Theorem and PCP

CS4510 L13A The Art of Reduction

CS4510 L13A The Art of Reduction

CS4510 L12B The Halting Problem

CS4510 L12B The Halting Problem

CS4510 L12A Godel Incompleteness

CS4510 L12A Godel Incompleteness

CS4510 L11A Crisis in Geometry

CS4510 L11A Crisis in Geometry

CS4510 L11B Russell's Paradox

CS4510 L11B Russell's Paradox

CS4510 L10B Diagonalization

CS4510 L10B Diagonalization

CS4510 L10A Countability

CS4510 L10A Countability

CS4510 L09B Turing-completeness

CS4510 L09B Turing-completeness

CS4510 L09A Simulation

CS4510 L09A Simulation

CS4510 L08B The Church-Turing Thesis

CS4510 L08B The Church-Turing Thesis

CS4510 L08A Turing Machines

CS4510 L08A Turing Machines

CS4510 L07B Non Context-Free Languages

CS4510 L07B Non Context-Free Languages

CS4510 L07A Every PDA has a CFG

CS4510 L07A Every PDA has a CFG

CS4510 L06B Every CFG has a PDA

CS4510 L06B Every CFG has a PDA

CS4510 L06A Pushdown Automata

CS4510 L06A Pushdown Automata

CS4510 L05B Chomsky Normal Form

CS4510 L05B Chomsky Normal Form

CS4510 L05A Syntactic Structures

CS4510 L05A Syntactic Structures

CS4510 L04A Context-Free Grammars

CS4510 L04A Context-Free Grammars

CS4510 L04B Closure

CS4510 L04B Closure

CS4510 L03B The Pumping Lemma

CS4510 L03B The Pumping Lemma

CS4510 L03A Regular Expressions

CS4510 L03A Regular Expressions

CS4510 L02A Nondeterminism

CS4510 L02A Nondeterminism

CS4510 L02B Powerset Construction

CS4510 L02B Powerset Construction

CS4510 L01B DFAs

CS4510 L01B DFAs

CS4510 L01A Introduction

CS4510 L01A Introduction

(CS4510 Automata and Complexity) 13-2 Some NP-complete Problems

(CS4510 Automata and Complexity) 13-2 Some NP-complete Problems

(CS4510 Automata and Complexity) 13-1 The Cook-Levin Theorem

(CS4510 Automata and Complexity) 13-1 The Cook-Levin Theorem

(CS4510 Automata and Complexity) 12-2 Time Complexity

(CS4510 Automata and Complexity) 12-2 Time Complexity

(CS4510 Automata and Complexity) 12-1 Introduction to Complexity

(CS4510 Automata and Complexity) 12-1 Introduction to Complexity

(CS4510 Automata and Complexity) 11-2 Busy Beavers & Kolmogorov Complexity

(CS4510 Automata and Complexity) 11-2 Busy Beavers & Kolmogorov Complexity

(CS4510 Automata and Complexity) 11-1 Godel Incompleteness

(CS4510 Automata and Complexity) 11-1 Godel Incompleteness

(CS4510 Automata and Complexity) 10-2 The Recursion Theorem

(CS4510 Automata and Complexity) 10-2 The Recursion Theorem

(CS4510 Automata and Complexity) 10-1 Rice's Theorem

(CS4510 Automata and Complexity) 10-1 Rice's Theorem

(CS4510 Automata and Complexity) 9-2 Post Correspondence Problem

(CS4510 Automata and Complexity) 9-2 Post Correspondence Problem

(CS4510 Automata and Complexity) 9-1 Context Sensitive Languages & Computation Histories

(CS4510 Automata and Complexity) 9-1 Context Sensitive Languages & Computation Histories

(CS4510 Automata and Complexity) 8-2 Reductions

(CS4510 Automata and Complexity) 8-2 Reductions

(CS4510 Automata and Complexity) 8-1 Some Decidable Problems

(CS4510 Automata and Complexity) 8-1 Some Decidable Problems

(CS4510 Automata and Complexity) 7-2 The Halting Problem

(CS4510 Automata and Complexity) 7-2 The Halting Problem

(CS4510 Automata and Complexity) 7-1 Diagonalization

(CS4510 Automata and Complexity) 7-1 Diagonalization

(CS4510 Automata and Complexity) 6-2 Turing-Completeness

(CS4510 Automata and Complexity) 6-2 Turing-Completeness

(CS4510 Automata and Complexity) 6-1 Church-Turing Thesis

(CS4510 Automata and Complexity) 6-1 Church-Turing Thesis

(CS4510 Automata and Complexity) 5-2 Turing Machines

(CS4510 Automata and Complexity) 5-2 Turing Machines

(CS4510 Automata and Complexity) 5-1 Each CFG has a PDA

(CS4510 Automata and Complexity) 5-1 Each CFG has a PDA

(CS4510 Automata and Complexity) 4-2 Push Down Automata

(CS4510 Automata and Complexity) 4-2 Push Down Automata

(CS4510 Automata and Complexity) 4-1 Pumping Lemma for CFLs & Closure

(CS4510 Automata and Complexity) 4-1 Pumping Lemma for CFLs & Closure

(CS4510 Automata and Complexity) 3-2 Chomsky Normal Form

(CS4510 Automata and Complexity) 3-2 Chomsky Normal Form

(CS4510 Automata and Complexity) 3-1 Regular and Context-Free Grammars

(CS4510 Automata and Complexity) 3-1 Regular and Context-Free Grammars

(CS4510 Automata and Complexity) 2-2 The Myhill-Nerode Theorem

(CS4510 Automata and Complexity) 2-2 The Myhill-Nerode Theorem

(CS4510 Automata and Complexity) 2-1 Regexes are Regular, and the Pumping Lemma

(CS4510 Automata and Complexity) 2-1 Regexes are Regular, and the Pumping Lemma

(CS4510 Automata and Complexity) 1-2 Closure & Regular Expressions

(CS4510 Automata and Complexity) 1-2 Closure & Regular Expressions

(CS4510 Automata and Complexity) 1-1 Introduction, DFAs and NFAs

(CS4510 Automata and Complexity) 1-1 Introduction, DFAs and NFAs