Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Stephen Cook
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Some other contributions=== He named the complexity class [[NC (complexity)|NC]] after [[Nick Pippenger]]. The complexity class [[SC (complexity)|SC]] is named after him.<ref>{{cite web|title="Steve's class": origin of SC|url=https://cstheory.stackexchange.com/q/9298 |work=Theoretical Computer Science β Stack Exchange}}</ref> The definition of the complexity class [[AC0|AC<sup>0</sup>]] and its hierarchy [[AC (complexity)|AC]] are also introduced by him.<ref>{{cite web|title=Who introduced the complexity class AC?|url=https://cstheory.stackexchange.com/q/12649|work=Theoretical Computer Science β Stack Exchange}}</ref> According to [[Don Knuth]] the [[KMP algorithm]] was inspired by Cook's automata for recognizing concatenated palindromes in [[linear time]].<ref>{{cite web|title=Twenty Questions for Donald Knuth|url=http://www.informit.com/articles/article.aspx?p=2213858}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)