P | NP | EXP | R Class Problems and Beyond That | Part I

preview_player
Показать описание
This lecture describes basics of classes P, EXP and R.
NP is discussed in detail in next part of this lecture.

Part - 2 can be found at

P, NP, EXP and R Class Problems and Beyond That - Part 1
  1. AskAtul
  2. #P #NP #EXP #Class #Complexity #Undecidability #NPComplete #NPHard #ComputerScience
Рекомендации по теме
P vs. NP 0:10:44

P vs. NP and the Computational Complexity Zoo

16. Complexity: P, 1:25:25

16. Complexity: P, NP, NP-completeness, Reductions

P, NP, EXP 0:05:19

P, NP, EXP explained

UIUC CS 374 0:11:08

UIUC CS 374 FA 20: 22.2.5. Intractability (P, NP, EXP)

P vs. NP: 0:19:44

P vs. NP: The Biggest Puzzle in Computer Science

Basic Complexity class: 0:24:44

Basic Complexity class: P, NP, PSPACE and EXP classes

P | NP 0:09:55

P | NP | EXP | R Class Problems and Beyond That | Part I

TOC: P, NP, 0:40:59

TOC: P, NP, NDTMs and Reduction

British Columbia PNP 0:00:36

British Columbia PNP Draw Invites Over 189 Candidates in Latest Round

Lecture 04 : 0:37:07

Lecture 04 : Part A - Classes P, NP, EXP

8. NP-Hard and 0:31:53

8. NP-Hard and NP-Complete Problems

P и NP 0:12:32

P и NP задачи

⨘ } Computational 0:11:28

⨘ } Computational Complexity } 3 } coNP, EXP, NEXP }

spezielle Komplexitätsklassen (EXP, 0:08:56

spezielle Komplexitätsklassen (EXP, PSPACE, NP, P, NL, L)

NP-COMPLETENESS - The 0:33:03

NP-COMPLETENESS - The Secret Link Between Thousands of Unsolved Math Problems

P = NP 0:11:16

P = NP Explained Visually (Big O Notation & Complexity Theory)

P vs NP 0:05:49

P vs NP on TV - Computerphile

# 1 Classe 0:26:55

# 1 Classe P, NP, NP-Complet, NP-Difficile

P=NP? - Intro 0:02:22

P=NP? - Intro to Algorithms

P=NP? 0:39:33

P=NP?

¿Qué es eso 0:06:08

¿Qué es eso del problema P versus NP?

PNP - Provincial 0:00:05

PNP - Provincial Nominee Program ! ☎️Contact Eduplor for more ! #pnp #pnpcanada #canadavisa

2-EXPTIME 0:01:59

2-EXPTIME

PR in Quebec 0:07:44

PR in Quebec | PEQ Program | PNP | Permanent Residency | CSQ | Certificat de sélection du Québec

Комментарии
Автор

What a topic to start with!
It's so informative to know the Solvability of Algorithms!
Algos taking time >100yrs time or usually very high time (10^9yrs) for completion are unsolvable - is it true?
Can you please give one example of a computer problem that is unsolvable?
How to know whether a problem falls in R or its subcategories or not! Full form of NP?
Way to go Sir!
I loved your video!
Great Going!
Amazing!

snehachakraborty
Автор

Thank you sir for such an initiative i have been one of your students and you have deep understanding of the core concepts. I hope to see some good content here.

ashwani_kumar_rai