Encyclopedia > Wikipedia:Wpc decision complexity class

  Article Content

Wikipedia:Wpc/decision complexity class

Table of contents

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

Generalizations:

Specializations: time complexity according to computational model

  • P (deterministic polynomial)
  • NP (nondeterministic polynomial)
space complexity

Involved in: Nothing yet


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
Thomas a Kempis

... 9), and the worship of saints (i. 13, ii. 9, iii. 6, 59). In other works, however, Thomas à Kempis exalts Mary as the queen of heaven, the efficient mediatress of ...

 
 
 
This page was created in 24.9 ms