Skip to main content
Theoretical Computer Science

Favorite Question

 Favorite Question
Question saved by 25 users. This badge can be awarded multiple times.
Awarded 91 times.
How do you get a "Physical Intuition" for results in TCS?
Awarded May 23, 2023 at 20:25
Surprising Results in Complexity (Not on the Complexity Blog List)
Awarded Mar 16, 2023 at 19:19
Book on Probability
Awarded Feb 21, 2023 at 7:51
Casual tours around proofs
Awarded Jan 4, 2023 at 16:47
Where and how did computers help prove a theorem?
Awarded Nov 27, 2021 at 22:20
Should we consider $\mathsf{P} \neq \mathsf{NP}$ a law of nature?
Awarded Sep 13, 2021 at 16:15
How do 'tactics' work in proof assistants?
Awarded Jun 20, 2021 at 5:17
How to find interesting research problems
Awarded May 13, 2021 at 1:06
Wikipedia-style explanation of Geometric Complexity Theory
Awarded Mar 23, 2021 at 5:28
Applications of representation theory of the symmetric group
Awarded Mar 19, 2021 at 6:40
Prerequisite for learning GCT
Awarded Mar 14, 2021 at 8:40
Polynomial-time algorithms with huge exponent/constant
Awarded Mar 4, 2021 at 6:11
What hierarchies and/or hierarchy theorems do you know?
Awarded Aug 11, 2020 at 7:22
Parameterized complexity from P to NP-hard and back again
Awarded Aug 11, 2020 at 5:33
The importance of Integrality Gap
Awarded Jun 22, 2020 at 13:11
More on PH in PP?
Awarded May 20, 2020 at 3:55
Overarching reasons why problems are in P or BPP
Awarded May 14, 2020 at 23:01
Rigour leading to insight
Awarded May 7, 2020 at 0:06
Theoretical explanations for practical success of SAT solvers?
Awarded Apr 15, 2020 at 5:05
Problems that can be used to show polynomial-time hardness results
Awarded Feb 10, 2020 at 9:40
Why would one ever use an Octree over a KD-tree?
Awarded Nov 14, 2019 at 12:40
Provable statements about genetic algorithms
Awarded Oct 15, 2019 at 19:20
What kind of answer does TCS want to the question "Why do neural networks work so well?"
Awarded Sep 6, 2019 at 16:50
Kolmogorov complexity applications in computational complexity
Awarded Jun 25, 2019 at 21:20
What constitutes denotational semantics?
Awarded Apr 6, 2019 at 8:55
Shallow versus Deep Embeddings
Awarded Mar 15, 2019 at 20:10
Why is 2SAT in P?
Awarded Feb 19, 2019 at 13:55
The origin of the notion of treewidth
Awarded Oct 23, 2018 at 17:50
To what extent is "advanced mathematics" needed/useful in A.I. research?
Awarded Apr 18, 2018 at 23:40
Open access journals
Awarded Apr 17, 2018 at 10:22
What is the actual time complexity of Gaussian elimination?
Awarded Mar 22, 2018 at 10:20
Universal Approximation Theorem — Neural Networks
Awarded Feb 23, 2018 at 5:48
What are some good introductory books on type theory?
Awarded Feb 4, 2018 at 20:59
Why go to theoretical computer science/research?
Awarded Feb 2, 2018 at 2:23
Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?)
Awarded Oct 28, 2017 at 1:18
Beautiful results in TCS
Awarded Aug 31, 2017 at 9:50
Is Norbert Blum's 2017 proof that $P \ne NP$ correct?
Awarded Aug 16, 2017 at 4:26
Applications of TCS to classical mathematics?
Awarded Aug 5, 2017 at 15:06
How do I get started in theoretical CS ?
Awarded Jul 28, 2017 at 2:22
What is the most intuitive dependent type theory I could learn?
Awarded Feb 22, 2017 at 10:07
What would a very simple quantum program look like?
Awarded Jan 9, 2017 at 18:51
Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?
Awarded Dec 30, 2016 at 20:32
Realizability theory: difference in power between Lambda calculus and Turing Machines
Awarded Aug 30, 2016 at 8:40
Research and open challenges in Programming Language Theory
Awarded Jun 7, 2016 at 11:31
One Stack, Two Queues
Awarded May 29, 2016 at 21:57
How important is knowing how to program for TCS?
Awarded Apr 22, 2016 at 14:03
A simple decision problem whose decidability is not known
Awarded Oct 4, 2015 at 7:47
Books on automata theory for self-study
Awarded Aug 10, 2015 at 21:54
Books on programming language semantics
Awarded Aug 6, 2015 at 2:07
Are there any open problems left about DFAs?
Awarded Apr 19, 2015 at 17:59
What CS blogs should everyone read?
Awarded Jan 11, 2015 at 9:57
Most memorable CS paper titles
Awarded Oct 25, 2014 at 12:43
Physics results in TCS?
Awarded May 8, 2014 at 7:29
Applications of topology to computer science
Awarded May 8, 2014 at 7:24
Uses of algebraic structures in theoretical computer science
Awarded Apr 23, 2014 at 2:41
What is the contribution of lambda calculus to the field of theory of computation?
Awarded Apr 1, 2014 at 7:40
How to shoot down your proofs
Awarded Feb 22, 2014 at 9:13
How practical is Automata Theory?
Awarded Jan 7, 2014 at 3:03
Core algorithms deployed
Awarded Nov 14, 2013 at 12:50
Are research papers hard to read?
Awarded Oct 21, 2013 at 16:43
1
2