Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

NP (complexity)

Related lectures (31)

Introduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.

Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.

Explores the theory of computability, decision problems, complexity classes, and the 'P vs. NP' conundrum.

Explores cryptanalysis in public-key systems and the power of interaction in interactive proofs, covering CO-NP, NP classes, P vs. NP, and more.

Explores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.

Covers the density operator formalism, polynomial time, NP problems, BPP, QMA, and probabilistic algorithms.

Introduces complexity classes, including P and NP, and explores examples of easy and hard problems.

Delves into oracles, certificates, and the NP complexity class, raising the fundamental P versus NP question.

Covers quantum algorithms, complexity classes, Grover's algorithm, and quantum information in computational complexity.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Examines NP problems, graph coloring, path optimization, and computational complexity distinctions in P and NP classes.

Delves into complexity theory, focusing on the P vs NP problem and the classification of computational problems based on efficiency.

Covers complexity classes, tractable problems, the class NP, NP-complete problems, and summarizes the concept of tractable problems.

Explores algorithm complexity, big-O notation, induction, recursion, and analysis of running times, covering NP problems and complexity classes.

Covers complexity classes, effect on computer time, tractable problems, class NP, and NP-complete problems.

Explores algorithmic challenges, time complexity, optimization, recursion, and probability calculations.

Covers challenges in bit-precise reasoning, including SMT-COMP results, AIG, bit-blasting, Tseitin transformation, and complexity classes.

Explores computational complexity, NP-completeness, and polynomial reductions in theoretical computer science.

Explores Belief Propagation on trees, discussing cavity marginals, message passing algorithms, and the computation of free entropy.

Explores Magnetohydrodynamic equilibrium and stability, ideal MHD solutions, 'hairy ball' theorem, and boundary conditions.