Takashi's Notes

Home

❯

courses

❯

theory of computation lecture notes

❯

Efficient verification of solutions: The class NP

Efficient verification of solutions: The class NP

Nov 21, 20251 min read

Efficient verification of solutions: The class NP

Prev: 09-efficient-solution-of-problems-the-class-p Next: 11-undecidability

Prev: 09-efficient-solution-of-problems-the-class-p Next: 11-undecidability


Graph View

Backlinks

  • Efficient solution of problems: The class P
  • Undecidability

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Discord Community