Takashi's Notes

Home

❯

courses

❯

theory of computation lecture notes

❯

Efficient verification of solutions: The class NP

Efficient verification of solutions: The class NP

May 30, 20231 min read

Efficient verification of solutions: The class NP

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

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


Graph View

Backlinks

  • Efficient solution of problems: The class P
  • Undecidability

Created with Quartz v4.5.1 © 2025

  • Homepage
  • GitHub
  • RSS
  • Sitemap