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
Battle Creek, Michigan

... density is 481.1/km² (1,246.0/mi²). There are 23,525 housing units at an average density of 212.1/km² (549.3/mi²). The racial makeup of the city is ...

 
 
 
This page was created in 35.4 ms