[Home]Wpc/NP tcs

HomePage | Wpc | Recent Changes | Preferences

Definition:

The decision complexity class which includes all [nondeterministically computationally tractable problems]? (and not any other problem).

Generalizations:

Specializations:

None yet

Involved in:


Relevant Wikipedia Articles:

the concept- complexity classes P and NP

related field(s)- complexity theory

potential real-world examples-


/Discussion?

HomePage | Wpc | Recent Changes | Preferences
This page is read-only | View other revisions
Last edited October 22, 2001 11:12 pm by Seb (diff)
Search: