NP complexity class/Related Articles

From Citizendium - Reading time: 1 min


See also changes related to NP complexity class, or pages that link to NP complexity class or to this page or whose text contains "NP complexity class".

Parent topics[edit]

Subtopics[edit]

  • P-versus-NP problem [r]: A famous open problem in complexity theory asking whether any decision problem that can be solved by a nondeterministic algorithm in polynomial time can also be solved deterministically in polynomial time. [e]

Other related topics[edit]

Articles related by keyphrases (Bot populated)[edit]


Licensed under CC BY-SA 3.0 | Source: https://citizendium.org/wiki/NP_complexity_class/Related_Articles
1 views |
↧ Download this article as ZWI file
Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF