Co-RE-complete

Poll without page-refresh

	del.icio.us
	Digg
	Furl
	Reddit
	Rojo
	Add to OnlyWire

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

This computer science-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "http://en.wikipedia.org/wiki/Co-RE-complete"

Categories: Computer science stubs | Complexity classes

This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License.

Giant Panda

Mercedes Car

This site monitored by SitePinger.net