Welcome to uiboss.com on July 6 2009.
This is an internet experiment running to monitor browsing habbits of individuals through wikipedia contents.

Co-RE-complete

From Wikipedia, the free encyclopedia

Jump to: navigation, search

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.

v • d • e
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 • NEXPTIME • EXPSPACE • 2-EXPTIME • PR • RE • Co-RE • RE-C • Co-RE-C • R • BQP • BPP • RP • ZPP • PCP • IP • PH 


  This computer science article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org/wiki/Co-RE-complete"
Personal tools
Languages
Visit joltnews for the latest headlines
Visit bloit.com for company information
Geed Media does computer consulting on long island.
This page viewed times. See Logs