Computational complexity theory
- Complexity classes are sets of problems that can be solved efficiently using a particular computational model.
- The complexity classes are defined using various methods, such as quantum Turing machines, interactive proof systems, and reductions.
- The time and space hierarchy theorems provide a basis for separation results between complexity classes.
- The P versus NP problem is one of the most important open questions in theoretical computer science, with wide implications.
- There are problems in NP that are neither in P nor NP-complete, called NP-intermediate problems.
- Many known complexity classes are suspected to be unequal, but this has not been proved.
- Пересказана только часть статьи. Для продолжения перейдите к чтению оригинала.
Полный текст статьи: