Events Tagged: "computational complexity"

3 events with tag "computational complexity"

1970 ID: 1881
Stephen Cook develops systematic computational complexity theory
ID: 1881
1971 ID: 420
Stephen Cook proves SAT is NP-complete, with implications for graph coloring and other problems
ID: 420
1971 ID: 4494
Stephen Cook formulates P vs NP problem
ID: 4494