[Home]Wpc/computationally intractable decision problem

HomePage | Wpc | Recent Changes | Preferences

Definition:

A decision problem for which there does not exist an algorithm? that solves it in [polynomial time]?.

Equivalently, a decision problem that is not in complexity class P.

Generalizations:

Specializations:

None yet

Involved in:

Nothing yet


Relevant Wikipedia Articles:

the concept-

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 10:54 pm by Seb (diff)
Search: