380 подписчиков
70 видео
Multi Tape Turing Machine
Context free grammar for string of balanced parenthesis
Vertex cover problem is NP complete
NP completeness
Traveling salesman problem Part 4/4
The Universal Turing machine
Pumping lemma for regular languages
Clique Problem is NP complete
Merge sort part 2/2
Circuit Sat Problem is NP Complete
Back tracking algorithm for 0 1 Knapsack Problem
Solving 4 queen problem using backtracking
The 4 queen problem
Is class P= Class NP?
Traveling sales man problem Part 2/4. Reducing cost matrix
Reducing a Problem to another
Travelling Salesman Problem is NP complete
The Complexity classes
Greedy Algorithm Control Abstraction
Traveling salesman problem Part 3/4
3CNF SAT Problem is NP complete
The fractional knapsack problem
SAT problem is NP complete
Introduction to complexity theory
Regular expression to epsilon NFA conversion (ab+a)*
Regular Expression to NFA
Turing Machine to compute a^nb^m such that m greater than n greater than 0
Hamiltonian Cycle problem is NP complete
O/1 (Zero One) Knapsack Problem
Traveling Salesman Problem Part 1/4
Finding strongly connected component of a graph
Disjoint set
Matrix chain multiplication using dynamic programming Part 2/3
Depth First search (DFS)
AVL Tree Rotation
