A grouping of problems in computational complexity theory. Problems in this class are equally hard to solve on a conventional computer as the hardest NP problems. However, they are not necessarily themselves NP problems. Commonly used as a benchmark of mathematical hardness.

FBI Admin

About the Author

Fact Based Insight - helping business prepare for tomorrow