Wikipedia: Wpc/decision complexity class

Difference (from prior minor revision) (no other diffs)

Changed: 11,12c11,12

* wpc/P tcs (deterministic polynomial)
* wpc/NP tcs (nondeterministic polynomial)

* P (deterministic polynomial)
* NP (nondeterministic polynomial)

Changed: 14c14

* wpc/PSPACE? (polynomial)

* PSPACE? (polynomial)

Definition:

A [complexity class]? which includes only decision problems.

time complexity according to computational model

space complexity

Nothing yet

the concept-

related field(s)- complexity theory

potential real-world examples-

/Discussion?