Co-RE-complete

From Wikipedia, the free encyclopedia

CO-RE-complete is the set of decision problems that are complete for the complexity class co-RE. In a sense, these are the complements of the "hardest" recursively enumerable problems.

Important complexity classes (more)
P • NP • co-NP • NP-C • co-NP-C • NP-hard • UP • #P • #P-C • L • NL • NC • P-C • PSPACE • PSPACE-C • EXPTIME • EXPSPACE • PR • RE • Co-RE • RE-C • Co-RE-C • R • BQP • BPP • RP • ZPP • PCP • IP • PH


Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../c/o/-/Co-RE-complete_6cfb.html"
In other languages