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

... a process called photophosphorylation[?]. ATP is a versatile source of chemical energy used in most biological processes. Note, however, that the light reaction produces no ...

This page was created in 24.8 ms