Все публикации

0:04:40

Travelling Salesman Problem is NP complete

0:07:35

Vertex cover problem is NP complete

0:07:14

SAT problem is NP complete

0:02:41

Reducing a Problem to another

0:03:16

NP completeness

0:03:58

Circuit Sat Problem is NP Complete

0:02:17

Hamiltonian Cycle problem is NP complete

0:09:48

Clique Problem is NP complete

0:05:00

3CNF SAT Problem is NP complete

0:05:51

Back tracking algorithm for 0 1 Knapsack Problem

0:01:17

Is class P= Class NP?

0:03:36

The Complexity classes

0:05:00

Introduction to complexity theory

0:05:31

Traveling salesman problem Part 4/4

0:06:14

Traveling sales man problem Part 2/4. Reducing cost matrix

0:11:53

Traveling salesman problem Part 3/4

0:01:40

Traveling Salesman Problem Part 1/4

0:03:29

Greedy Algorithm Control Abstraction

0:11:55

O/1 (Zero One) Knapsack Problem

0:08:13

AVL Tree Rotation

0:05:42

The 4 queen problem

0:06:41

The n queen problem and backtracking algorithm to solve n queen problem.

0:10:30

Solving 4 queen problem using backtracking

0:10:21

The fractional knapsack problem