NP-Complete Problems Courses and Certifications

Advanced Algorithms - COMPSCI 224

41 reviews

Explore cutting-edge algorithmic techniques through comprehensive lectures, enhancing problem-solving skills and deepening understanding of complex computational challenges.

• YouTube
• 1 day 11 hours
• On-Demand
• Free Video

Automata Theory

20 reviews

Explore finite automata, context-free grammars, Turing machines, and intractable problems in this comprehensive study of theoretical computer science foundations.

• edX
• 7 weeks, 5-10 hours a week
• On-Demand
• Free Online Course (Audit)

NP-Complete Problems

Learn about NP-complete problems, known as hard problems that can’t be solved efficiently, and practice solving them using algorithmic techniques.

• edX
• 3 weeks, 8-10 hours a week
• On-Demand
• Free Online Course (Audit)

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

829 ratings at Coursera

Explore advanced graph algorithms, NP-completeness, and strategies for tackling computationally intractable problems. Learn Bellman-Ford, Floyd-Warshall, and heuristic approaches for complex algorithmic challenges.

• Coursera
• 13 hours 27 minutes
• On-Demand
• Paid Course

ACM SIGPLAN

Pushing the Limit of 1-Minimality of Language-Agnostic Program Reduction

Explore Vulcan, a framework enhancing language-agnostic program reducers through diverse transformations, outperforming state-of-the-art tools in minimizing bug-triggering programs across multiple languages.

• YouTube
• 17 minutes
• On-Demand
• Free Video

Computability, Complexity & Algorithms

1 review

Learn tools and techniques that will help you recognize when problems you encounter are intractable and when there an efficient solution.

• Udacity
• 15 hours
• On-Demand
• Free Online Course

NPTEL;  IIT Madras

Theory of Automata, Formal Languages and Computation

9 reviews

Explore automata theory, formal languages, and computation through grammars, finite state automata, pushdown automata, Turing machines, and advanced topics in theoretical computer science.

• YouTube
• 1 day 15 hours
• On-Demand
• Free Video

Advanced Algorithms and Complexity

701 ratings at Coursera

Explore advanced algorithms for network flows, linear programming, NP-complete problems, and streaming. Learn to solve complex computational challenges and optimize real-world systems efficiently.

• Coursera
• 1 day 3 hours 15 minutes
• On-Demand
• Paid Course

Microcredential

Algorithms and Data Structures

Comprehensive program covering algorithmic techniques, data structures, and their applications in computational problem-solving. Includes hands-on coding challenges and real-world applications in genomics and machine learning.

• edX
• 36 weeks, 8-10 hours a week
• On-Demand
• $1,200.00
• 8 courses

Ryan O'Donnell

Quantum Complexity - Quantum Computation at CMU

Explore quantum complexity, error probabilities, and complexity classes in this advanced lecture on quantum computation and information theory.

• YouTube
• 1 hour 23 minutes
• On-Demand
• Free Video

Insights into Mathematics

Trying to Sidestep the SAT Problem - N J Wildberger

Explores the SAT problem in Boolean algebra and logic circuits, introducing the Algebra of Boole approach as an alternative for analyzing smaller circuits and potentially addressing larger-scale issues in integrated circuit design.

• YouTube
• 28 minutes
• On-Demand
• Free Video

Simons Institute

SAT-Solving

Explore SAT-solving techniques, from basic concepts to advanced strategies, covering variables, local constraints, operators, and interactive CDCL procedures for efficient problem-solving.

• YouTube
• 2 hours 3 minutes
• On-Demand
• Free Video

Simons Institute

A Brief Introduction to Algorithms, Game Theory and Risk-Averse Decision Making

Explore algorithms, game theory, and risk-averse decision making, covering shortest paths, NP-Complete problems, equilibria, and various risk frameworks for real-world applications.

• YouTube
• 1 hour 12 minutes
• On-Demand
• Free Video

Harvard CMSA

The P vs. NP Problem - An Existential Question for Mathematics

Explore the profound P vs NP problem and its implications for mathematics, computing, and automated proof search in this millennium prize lecture by Harvard's Madhu Sudan.

• YouTube
• 1 hour
• On-Demand
• Free Video

Probabilistically Checkable Proofs via GKR and Interactive Arguments - Lecture 4

Delve into advanced cryptography concepts focusing on probabilistically checkable proofs (PCP), GKR protocol construction, and interactive succinct arguments for NP computation verification.

• YouTube
• 1 hour 11 minutes
• On-Demand
• Free Video