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
French resistance

... liaise between Gaullist BCRA and SOE activities in Paris. In February 1944 he was betrayed and Gestapo arrested him. Eventually Jean Moulin convinced Armee Secrete, ...

 
 
 
This page was created in 22 ms