Alexandria Library

A curated collection of awesome articles

Here are some ressources related to Np-problems, Algorithms, Polynomial. Hoping you will find learning material, alternative tools or just some interesting stuff.

Home > Programming, Machine Learning, Quan... > Mathematics, Algorithms, Cryptograp... > Quantum, Algorithms, Graph, Computa... > Np-problems, Algorithms, Polynomial...

Articles

Problems harder than NP-Complete

See discussion (98 comments, 254 points) - Archive

Introduction to P vs. NP

See discussion (39 comments, 135 points) - Archive

NP-complete isn't always hard

See discussion (73 comments, 115 points) - Archive

Symbolic Regression is NP-hard

See discussion (39 comments, 109 points) - Archive

Quantum algorithms conquer a new kind of problem

See discussion (32 comments, 83 points) - Archive

The genius of John von Neumann

See discussion (107 comments, 126 points) - Archive

The 50-year-old P-NP problem that eludes theoretical computer science

See discussion (94 comments, 100 points) - Archive

Markets are efficient if and only if P=NP (2010)

See discussion (169 comments, 214 points) - Archive

The Knapsack Problem Is All Around Us

See discussion (43 comments, 128 points) - Archive

Predicting When P=NP Is Resolved

See discussion (62 comments, 106 points) - Archive

P = NP Proofs: Advice to claimers

See discussion (156 comments, 153 points) - Archive

A Short Guide to Hard Problems

See discussion (17 comments, 213 points) - Archive

A Problem That Only Quantum Computers Will Ever Be Able to Solve

See discussion (32 comments, 84 points) - Archive

Markets are efficient if and only if P = NP (2010)

See discussion (191 comments, 332 points) - Archive

The Scientific Case for P≠NP

See discussion (100 comments, 125 points) - Archive

A Solution of the P versus NP Problem?

See discussion (286 comments, 662 points) - Archive

On Norbert Blum’s claimed proof that P does not equal NP

See discussion (68 comments, 139 points) - Archive

Bitcoin Mining is NP-hard (2014)

See discussion (20 comments, 92 points) - Archive

P vs. NP

See discussion (71 comments, 390 points) - Archive

Version SAT

See discussion (19 comments, 103 points) - Archive

The P=?NP Poll (2002) [pdf]

See discussion (83 comments, 97 points) - Archive

Random Solutions are Often Good Enough

See discussion (41 comments, 147 points) - Archive

List of unsolved problems in computer science

See discussion (42 comments, 99 points) - Archive

Traveling Salesman: the most misunderstood problem

See discussion (43 comments, 115 points) - Archive

Markets are efficient if and only if P = NP

See discussion (123 comments, 107 points) - Archive

P vs NP on simple english wikipedia - feedback, please

See discussion (59 comments, 93 points) - Archive

Markets are Efficient if and Only if P = NP

See discussion (83 comments, 154 points) - Archive

What if P = NP?

See discussion (74 comments, 124 points) - Archive

Proving P!=NP: "...Ryan has taken the first real baby step in decades."

See discussion (5 comments, 95 points) - Archive

P vs. NP for Dummies

See discussion (36 comments, 97 points) - Archive

Update on Deolalikar’s Proof that P≠NP

See discussion (19 comments, 95 points) - Archive

Issues in the Proof that P ≠ NP

See discussion (33 comments, 108 points) - Archive

R.J. Lipton - A proof that P is not equal to NP

See discussion (7 comments, 81 points) - Archive

S. Cook: “This appears to be a relatively serious claim to have solved P vs NP.”

See discussion (2 comments, 91 points) - Archive

The Status of the P Versus NP Problem

See discussion (45 comments, 118 points) - Archive