Encyclopedia > Wpc computationally tractable decision problem

Article Content

Wikipedia:Wpc/computationally tractable decision problem

Redirected from Wpc/computationally tractable decision problem

Table of contents

2 Generalizations:

3 Specializations:

5 Relevant Wikipedia Articles:

Definition: A decision problem for which there exists an algorithm[?] that solves it in polynomial time[?].

Equivalently, a member of complexity class P.

Generalizations:

Specializations: None yet

Involved in:

P

Relevant Wikipedia Articles: the concept-

related field(s)- computational complexity theory

potential real-world examples-

See also : Wpc

All Wikipedia text is available under the terms of the GNU Free Documentation License

Search Encyclopedia

Search over one million articles, find something about almost anything!

Featured Article

... first to have the title of "Tyrant" was Pisistratus in 560 BC. In modern times Tyrant has come to mean a dictator who rules with cruelty. Bullying ...

This page was created in 30.2 ms