NP-completeness

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

1 player has it in their collection.

What Wikipedia says

In computational complexity theory, NP-complete problems are the hardest of the problems to which solutions can be verified quickly.

Excerpt from the Wikipedia article “NP-completeness”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Behnam Esfahbod, CC BY-SA 3.0, via Wikimedia Commons.