Theoretical Computer Science

Great Answer

 Great Answer
Answer score of 100 or more. This badge can be awarded multiple times.
Awarded 19 times.
Why is 2SAT in P?
Awarded Dec 21, 2022 at 19:41
What Books Should Everyone Read?
Awarded Dec 19, 2022 at 17:41
Is Norbert Blum's 2017 proof that $P \ne NP$ correct?
Awarded May 19, 2021 at 5:47
A simple decision problem whose decidability is not known
Awarded Oct 13, 2020 at 13:37
What is the contribution of lambda calculus to the field of theory of computation?
Awarded Aug 4, 2020 at 18:57
Advice on good research practices
Awarded Feb 14, 2020 at 6:10
Problems Between P and NPC
Awarded Nov 14, 2018 at 16:20
Algorithms from the Book
Awarded Nov 13, 2016 at 8:09
What papers should everyone read?
Awarded Aug 29, 2016 at 16:32
Algorithms from the Book
Awarded Sep 16, 2015 at 17:46
Was the reduction in Shor's algorithm originally discovered by Shor?
Awarded Aug 13, 2015 at 20:10
Major unsolved problems in theoretical computer science?
Awarded Feb 14, 2015 at 1:33
Major unsolved problems in theoretical computer science?
Awarded May 22, 2014 at 7:25
What papers should everyone read?
Awarded Dec 24, 2013 at 22:34
Core algorithms deployed
Awarded Nov 24, 2013 at 5:13
What papers should everyone read?
Awarded Jul 15, 2013 at 19:14
What is the enlightenment I'm supposed to attain after studying finite automata?
Awarded Dec 25, 2012 at 17:07
Are research papers hard to read?
Awarded Nov 15, 2012 at 15:14
What's new in purely functional data structures since Okasaki?
Awarded May 2, 2011 at 16:13

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.