“PSPACE and EXP are the next two big steps above NP in the complexity hierarchy.

“Then there’s NEXP then EXPSPACE, then EEXP then NEEXP then EEXPSPACE, and so on ad infinitum. Whee!

They do that in computer science, don’t they? Yeah?

From Jeff Erickson‘s Lecture 21: NP-Hard Problems available at http://drona.csa.iisc.ernet.in/~gsat/Course/DAA/lecture_notes/jeff_nphard.pdf

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s