Citizendium - a community developing a quality, comprehensive compendium of knowledge, online and free.
Click here to join and contribute
CZ thanks our previous donors. Donate here. Treasurer's Financial Report

P-versus-NP problem/Related Articles

From Citizendium
Jump to: navigation, search
P-versus-NP problem: 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]

This article contains just a definition and optionally other subpages (such as a list of related articles), but no metadata. Create the metadata page if you want to expand this into a full article.

Parent topics


Other related topics