Knowledge

Home

❯

Notes

❯

NP Complete

NP Complete

Feb 09, 20251 min read

  • Computers

Problems for which a solution cannot be found in polynomial time by a deterministic Turing Machine but can be verified in polynomial time

Topics

  • Polynomial-Time Reducible
  • Maximum Clique Problem
  • Maximum Independent Set Problem
  • Boolean Satisfiability Problem
  • Vertex Cover Problem
  • Subset Problem

Graph View

Backlinks

  • NP (complexity)
  • Vertex Cover Problem

Created with Quartz v4.5.2 © 2026

  • Personal Site
  • GitHub