Back to Results
First PageMeta Content
Complexity classes / NP-complete / Cook–Levin theorem / P versus NP problem / NP-hard / NP / Stephen Cook / Clique problem / P / Theoretical computer science / Computational complexity theory / Applied mathematics


A Brief History of NP-Completeness, 1954–2012 David S. Johnson Mathematics subject classification: 68-03, 68Q17, 68Q25, 68W25, 90C05, 90C22
Add to Reading List

Document Date: 2012-09-06 18:30:18

Open Document

File Size: 1,07 MB

Share Result on Facebook

City

Moscow / Novosibirsk / Princeton / Berlin / Leningrad / /

Company

3SAT / Prentice-Hall / Cobham / IBM / AT&T / Bell Labs / Google / ACM Special Interest Group / VERTEX / /

Country

Russia / United States / Soviet Union / /

Currency

USD / /

Facility

University of Moscow / University of Washington / University of California / Boston University / Clay Mathematics Institute / Carnegie-Mellon University / IBM T.J. Watson Research Center / University of Toronto / /

IndustryTerm

search versions / ellipsoid algorithm / universal search problem / sequential search problems / polynomial-time algorithms / feasible solution / search problem version / chemicals / simplex algorithm / approximation algorithm / search problem / graph product / exhaustive search / approximation algorithms / search problems / polynomial-time approximation algorithm / universal search problems / parallel processors / /

Movie

A Beautiful Mind / /

OperatingSystem

UNIX / /

Organization

UC Berkeley / Computer Science Department / United States National Security Agency / Carnegie-Mellon University / Summit Child Care Center / Boston University / NYU / IEEE Technical Committee on the Mathematical Foundations of Computing / University of Washington in Seattle / University of Moscow / Cornell / MIT / Harvard / University of California / Berkeley / Institute for Advanced Study / STOC PC / Mathematics Department / Clay Mathematics Institute / University of Toronto / /

Person

Kolmogorov / Michael Rabin / Steve Cook / Vijay Vazirani / Richard Karp / Don Knuth / Gene Lawler / Dorit Hochbaum / Michael Garey / Leonid Levin / Jeff Ullman / Dick / Ron Fagin / Stephen Cook / John von Neumann / David S. Johnson / Bob Tarjan / M. Gr¨otschel / Ron Graham / John Nash / Mike Garey / John Hopcroft / Dorothy Wilson / Albert Meyer / S. Johnson Mathematics / Juris Hartmanis / Alan Turing / Mike Fischer / Nick Pippenger / Jenene Garey / Levin Figure / /

Position

advisor / Full Professor / Traveling Salesman / initial artist / mathematician / Professor / primitive phototypesetter / school teacher / Associate Professor / Professor of Nutrition / editor / co-author / Assistant Professor / /

Product

NP / /

ProgrammingLanguage

Mathematica / /

ProvinceOrState

South Carolina / California / New Jersey / /

PublishedMedium

Theory of Computing / /

Technology

encryption / cryptography / approximation algorithms / analyzing approximation algorithms / polynomial-time approximation algorithm / CRM / UNIX / polynomial-time algorithms / simplex algorithm / ellipsoid algorithm / approximation algorithm / 1971 Algorithms / /

URL

http /

SocialTag