Encyclopedia > Wpc computationally tractable decision problem

Article Content

Wikipedia:Wpc/computationally tractable decision problem

Redirected from Wpc/computationally tractable decision problem

Table of contents

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

List of closed London Underground stations

... tube station[?] Wendover tube station[?] Stoke Mandeville tube station[?] Aylesbury station[?] West Ealing station[?] Hanwell station[?] Southall station[?] Hayes ...