P versus NP problem
1971Major
Stephen Cook defines NP-completeness, asking whether problems quick to check are also quick to solve. It becomes the central open question of computer science.
▲ Matters Save Share Trace roots
Longest chain: The Big Bang → First stars ignite → Supernovae seed heavy elements → The Sun forms → Earth forms → First oceans → First life → Photosynthesis evolves → Great Oxidation Event → Complex cells (eukaryotes) → Multicellular life → First animals → Cambrian Explosion → First vertebrates → Jawed fish → Fish walk onto land → The amniotic egg → The Great Dying → Dinosaurs appear → Asteroid ends the dinosaurs → Early primates → Apes split from monkeys → Human line splits from chimpanzees → Walking upright → First stone tools → Genus Homo appears → Homo erectus → Control of fire → Habitual fire and cooking → Homo sapiens appears → Complex language → Natufian villages → Oldest known bread → Agriculture begins → Irrigation → Uruk and the first cities → Cylinder seals → Writing (cuneiform) → Babylonian mathematics → Babylonian astronomical diaries → Thales and natural philosophy → Trial and death of Socrates → Plato's Academy → Aristotle's Lyceum → Alexander's conquests → Death of Alexander and the Hellenistic kingdoms → Seleucid Empire founded → Parthian Empire founded → Sasanian Empire → Birth of Muhammad → Muhammad's first revelations → The Hijra → Conquest of Mecca → Death of Muhammad and the Rashidun caliphate → Arab conquests → Abbasid Caliphate → Battle of Talas → Paper reaches the Islamic world → House of Wisdom → Al-Khwarizmi and algebra → Descartes and analytic geometry → Calculus → Euler and graph theory → Fourier analysis → Cantor's set theory → Principia Mathematica → Gödel's incompleteness theorems → Turing machine → P versus NP problem
Community notes Loading notes…
Learn more ranked by votes