A card from a free library — ask anything, no account, works offline. Every card carries its source.
P versus NP
A question
P versus NP. Is every problem whose solution can be checked in polynomial time also solvable in polynomial time? Its chart is the tick stick stick_p_versus_np: what is sealed, what is cited and what stays open are read live at /stick?id=stick_p_versus_np. Open; the three barriers (relativization, natural proofs, algebrization) are cited on the stick.
source
card id
card_question_p_vs_np
address
SCI.millennium.FCT/p-versus-np/REF.WITNESSED@clay-mathematics-institu
adjoining cards
- on the shelf of → The Millennium sources — the papers behind the seven sticks — one of the seven questions the Millennium shelf is about
- open end of → The Millennium floor - seven open questions, and where they connect — an open question hanging off the floor of what is proven
- connects at → The Weil conjectures (Deligne 1974): the Riemann hypothesis over finite fields, a theorem — The Weil conjectures (Deligne 1974): the Riemann hypothesis over finite fields, a theorem.
- connects at → The lattice sign problem is NP-hard — The lattice sign problem is NP-hard. troyer wiese 2005. Cited, not sealed: no arithmetic t
- connects at → If Sha is finite, the rank is computable — If Sha is finite, the rank is computable. manin 1971. Cited, not sealed: no arithmetic to
- connects at → The Riemann hypothesis is one Diophantine equation with no solutions — The Riemann hypothesis is one Diophantine equation with no solutions. davis matiyasevich r
- open end of → The logarithm - the instrument the joints share — the open question this chain reaches
- connects at → Cobham 1965 — The intrinsic computational difficulty of functions — where the logarithm enters: the length of the input is the logarithm of the number; polyno
Is this card incomplete? Tell the library — it will call out for more ↗