Complexity Classes - P | NP | Co-NP | NP-Hard Classes

  Рет қаралды 51,587

Coding Blocks

Coding Blocks

Күн бұрын

Пікірлер: 25
@continnum_radhe-radhe
@continnum_radhe-radhe Жыл бұрын
❤❤❤
@nafizbasaran1907
@nafizbasaran1907 5 ай бұрын
Thanks for the video. As a contribution, P is subset of intersection of NP and co-NP. Intersection of NP and co-NP is not equal to P as far as we know. For example RSA problem, we know that it is both NP and co-NP but we don't have polynomial time algorithm to solve it.
@venkatachengalvala4289
@venkatachengalvala4289 3 жыл бұрын
Good video. One correction is that the P and NP classes aren't completely distinct. P is a subset of NP (i.e., the NP class contains the P class).
@PaulmarkMwema
@PaulmarkMwema 10 ай бұрын
has it really been proved?
@kshitijagarwal3230
@kshitijagarwal3230 6 жыл бұрын
Great Content Bhaiya!!
@CodingBlocksIndia
@CodingBlocksIndia 6 жыл бұрын
Thanks, Kshitij. Stay tuned for more content on exam preparation and algorithms.
@wgooglie8854
@wgooglie8854 4 жыл бұрын
Sir we can say this that this is classes of allgorithm according to complexity??? Plz answer this soon...
@aveekbiswas2176
@aveekbiswas2176 5 жыл бұрын
Can there be no problem which is NP and Co-NP but not P? If not, can you please also give some intuition behind that? By the way, can a problem be both NP and co-NP at the same time as shown in the Venn diagram?
@devanshsharma8543
@devanshsharma8543 7 ай бұрын
man you're (were) so confused !! Like just reading what you asked cracks me up lol
@peoplecallmejolly
@peoplecallmejolly 6 жыл бұрын
Pls make a playlist for Complexity theory videos
@guilhermeluz3257
@guilhermeluz3257 4 жыл бұрын
Partei ob
@pranjalkandhari
@pranjalkandhari 5 жыл бұрын
Sir, verifying a problem is a decision problem while the original problem of selecting the student is not a decision problem. So which is an NP class problem: Problem to select to student or problem to verify whether the selection is correct or not?
@babuchingangbam1135
@babuchingangbam1135 6 жыл бұрын
Please elaborate polynomial time?
@tuval-v7p
@tuval-v7p 6 ай бұрын
thanks
@brilltwoant27
@brilltwoant27 4 жыл бұрын
Am I the only unfortunate guy here who is now studying this only because UGC decided to conduct exams xD
@babuchingangbam1135
@babuchingangbam1135 6 жыл бұрын
What the resources of complexity theory? Is it time?
@prem4302
@prem4302 4 жыл бұрын
Time, space and sometimes energy
@factsrandom350
@factsrandom350 6 жыл бұрын
The algorithm which helps to solve decision problem is known decision procedure. Am i right or wrong pls tell me?
@CodingBlocksIndia
@CodingBlocksIndia 6 жыл бұрын
Yes
@arghadeepmisra7865
@arghadeepmisra7865 2 жыл бұрын
2 Min concept explanation 17min22sec Writing I want to find a practicality here
@arturr5
@arturr5 3 жыл бұрын
what does deterministic/nondeterministic mean?????????????????????????????????????????????????????????????????????????????????
@tjyaooo9203
@tjyaooo9203 5 жыл бұрын
had to play it on 1.25x speed, as you're taling way too slow. Other than that, great explanation though
@cryptotube3016
@cryptotube3016 4 жыл бұрын
YES or NO Does your dad know that your gay? Hahaha😀😮 I am straight by the way
Np-Complete Problems | Reduction Theory | Np and Np Hard Problem
15:26
P, NP and Approximation Algorithms: Prof. Naveen Garg, IIT-Delhi
41:04
Quando eu quero Sushi (sem desperdiçar) 🍣
00:26
Los Wagners
Рет қаралды 15 МЛН
小丑教训坏蛋 #小丑 #天使 #shorts
00:49
好人小丑
Рет қаралды 54 МЛН
8. NP-Hard and NP-Complete Problems
31:53
Abdul Bari
Рет қаралды 2,1 МЛН
Biggest Puzzle in Computer Science: P vs. NP
19:44
Quanta Magazine
Рет қаралды 953 М.
16. Complexity: P, NP, NP-completeness, Reductions
1:25:25
MIT OpenCourseWare
Рет қаралды 423 М.
Lecture 23: Computational Complexity
51:12
MIT OpenCourseWare
Рет қаралды 525 М.
7 Outside The Box Puzzles
12:16
MindYourDecisions
Рет қаралды 509 М.
Decidability and Undecidability
7:42
Neso Academy
Рет қаралды 522 М.
What P vs NP is actually about
17:58
Polylog
Рет қаралды 146 М.