Home›Articles›The 1971 paper that defined NP-completenessArticleThe 1971 paper that defined NP-completenessArticlesConnectionsSourcesComments (0)Reader Challenges (0)ConnectionsArticle OnStephen Cook, Pioneers Well-attested SourcesWikipedia: Stephen Cooktier 2Wikimedia FoundationResearchQuote, ResearchIn his seminal 1971 paper "The Complexity of Theorem Proving Procedures", Cook formalized the notions of polynomial-time reduction (also known as Cook reduction) and NP-completeness, and proved the existence of an NP-complete problem by showing that the Boolean satisfiability problem (usually known as SAT) is NP-complete.View the SourceAtlas Article Vocabularytier 1AtlasComments (0)No comments yet. Be the first to share a thought.Sign in to join the discussion.Reader Challenges (0)No disputes yet. Spotted an error or a better source? Open the first one.Sign in to dispute this or suggest a correction.