OurBigBook About$ Donate
 Sign in Sign up

Stephen Cook

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Theoretical computer science Theoretical computer scientists
 0 By others on same topic  0 Discussions Create my own version
Stephen Cook is a prominent computer scientist known for his foundational work in computational complexity theory. He is best known for formulating the concept of NP-completeness in 1971, which provides a framework for understanding the inherent difficulty of computational problems. Cook's theorem demonstrates that the Boolean satisfiability problem (SAT) is NP-complete, meaning that if there is a polynomial-time algorithm for SAT, then there is a polynomial-time algorithm for all problems in the class NP.

 Ancestors (6)

  1. Theoretical computer scientists
  2. Theoretical computer science
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook