WikiTrade

P versus NP problem

The P versus NP problem is a major unsolved problem in theoretical computer science. Informally, it asks whether every decision problem for which a proposed positive answer can be quickly verified can also be quickly solved.

On WikiTrade, every Wikipedia article is a card: the more the article is read, the rarer the card. Open free packs, complete your album, trade, bid and challenge others to general-knowledge duels.

Text from Wikipedia (CC BY-SA 4.0). WikiTrade is an independent site, not affiliated with Wikipedia or the Wikimedia Foundation.