P and NP Class Problem and Polynomial Time Solvable (English+Hindi)

Показать описание

The Great Learning Festival is here!
Get an Unacademy Subscription of 7 Days for FREE!

Unacademy Computer Science

Рекомендации по теме

Комментарии

GATE Unlock25 Offer
Get flat 25% & FREE Extension
Join the new Foundation batches for GATE, ESE*, & PSUs 2024

UnacademyComputerScience

This becomes very useful for me when I first read about P, NP and NP-Hard problems from university's given handouts and now this explanation is making some clearances. Thank you sir..

Farrukhw

Nice explanation sir.i want to know exact representation of Np in form of equation. and which problem exactly represents Np. Because there are so many problems in Np.

vishwanathaeducationalchan

Explained effectively, well done thank you sir.

avinashbg

You've done a great job, uploading these videos.

OliverJoshuaJacob

Prices rising by 10% on 30th April'23 11:59 PM

Flat 25% off & up to 4 Months Extra*! Save up to 53%

Unacademy GATE & ESE Ultra Combat
23rd April at 11:00 AM

UnacademyComputerScience

Ye jo box bnaya ha apne is ka name kia bol rhe ha plz bta de

sidraashraf

cant understand your english
good job though

stefantincescu

Never watch this video insufficient explanation

alex-vqyy

horrible english mingled with ambiguous hindi

suvomkarak

plz dont speak english if u cant in hindi instead

me_amir

P and NP Class Problem and Polynomial Time Solvable (English+Hindi)

P vs. NP and the Computational Complexity Zoo

P and NP - Georgia Tech - Computability, Complexity, Theory: Complexity

8. NP-Hard and NP-Complete Problems

P and NP Class Problem and Polynomial Time Solvable (English+Hindi)

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

P vs. NP: The Biggest Puzzle in Computer Science

P AND NP CLASS PROBLEM

N problem NP problem || NP hard and NP complete problem || design and analysis of algorithms | daa

P vs. NP - The Biggest Unsolved Problem in Computer Science

P and NP

Understanding P and NP class Problems

P NP NP-Hard NP-Complete problems in Urdu/Hindi

P, NP, NP-Hard and NP-Complete Problems

NP-Complete Explained (Cook-Levin Theorem)

P and NP Class Problems Explained | GATE | Algorithm Analysis | COMPUTER SCIENCE ENGINEERING

complexity classes | P & NP | TOC | Lec-96 | Bhanu Priya

NP HARD AND NP COMPLETE

NP-Hardness

P vs. NP - An Introduction

P and NP Class Problems: Decision & Optimization |Algorithms Analysis| COMPUTER SCIENCE ENGINEER...

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

NP Hard and NP Complete Problems

NP completeness (P, NP and NPC) Polynomial, Non-Polynomial, NP-Complete and NP hard algorithms

P and NP class - lecture90/ADA