class p and np

In this video, you’ll learn what Class P and Class NP really mean in computational complexity. We’ll clearly explain polynomial-time solvable problems (P), polynomial-time verifiable problems (NP), give intuitive examples like shortest path, SAT, and Hamiltonian cycle, and discuss why the famous P vs NP question is still unsolved and so important for algorithms, optimization, and cryptography.

Видео class p and np канала NISHA SOMS