Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Theory of Computation: NP Problems Examples
Graph Chatbot
Related lectures (28)
Previous
Page 2 of 3
Next
Complexity of Algorithms: Big-O Notation
Explores algorithm complexity, big-O notation, induction, recursion, and analysis of running times, covering NP problems and complexity classes.
Complexity Classes: Introduction and Examples
Introduces complexity classes, including P and NP, and explores examples of easy and hard problems.
Quantum Approximate Optimization Algorithm
Covers the Quantum Approximate Optimization Algorithm, physically inspired unitary coupled cluster ansatz, hardware-efficient ansatz, and variational quantum eigensolver.
Understanding Complexity: Algorithms and NP Problems
Covers complexity classes, tractable problems, the class NP, NP-complete problems, and summarizes the concept of tractable problems.
Computational Complexity: Theory and Applications
Explores computational complexity, NP-completeness, and polynomial reductions in theoretical computer science.
Understanding Complexity: Tractable Problems and NP-Complete
Covers complexity classes, effect on computer time, tractable problems, class NP, and NP-complete problems.
Minimum Spanning Trees: Prim's Algorithm
Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.
Integer Optimization: Theory and Applications
Covers the fundamentals of integer optimization, including integer programming, dynamic programming, and approximation algorithms.
Graph Coloring: Random vs Symmetrical
Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.
Theory of Computation: NP Complexity
Delves into oracles, certificates, and the NP complexity class, raising the fundamental P versus NP question.
