Encyclopedia > Wikipedia:Wpc computationally tractable decision problem

Article Content

Wikipedia:Wpc/computationally tractable decision problem

Table of contents

1 Definition:

2 Generalizations:

3 Specializations:

4 Involved in:

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:

Relevant Wikipedia Articles: the concept-

related field(s)- computational complexity theory

potential real-world examples-

/Discussion

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

Westhampton Beach, New York

... American, 0.42% Native American, 1.16% Asian, 0.05% Pacific Islander, 2.84% from other races, and 1.74% from two or more races. 7.68% of the population are Hispanic or ...