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
Digital Rights Management

... been employed to restrict access to eBooks[?]. See the TCPA / Pallidium FAQ maintained by Professor Ross J Anderson on his Web site at www.cl.cam.ac.uk/~rja14/tcpa-faq.html/ ...

 
 
 
This page was created in 31.1 ms