Theoretical Computer Science

Nice Answer

 Nice Answer
Answer score of 10 or more. This badge can be awarded multiple times.
Awarded 4274 times.
Error in Robson's proof about separating strings?
Awarded Dec 2 at 10:51
What is worst case complexity of number field sieve?
Awarded Nov 23 at 8:52
Is there a SETH (Strong Exponential Time Hypothesis) for CSP (Constraint Satisfaction Problem)?
Awarded Nov 21 at 10:31
AM/MA and NP in analogy to P and BPP
Awarded Nov 20 at 13:55
What exactly is "large elimination"?
Awarded Nov 19 at 6:08
Relation between $AC^0$ and regular languages
Awarded Nov 1 at 17:55
Chomsky Schützenberger enumeration theorem
Awarded Oct 28 at 9:50
Why most of the top TCS conferences are not double-blind?
Awarded Oct 21 at 12:27
Oracle results on P vs BPP
Awarded Oct 12 at 8:56
Polynomial time solvable in series parallel graph but NP-hard in graph with bounded treewidth
Awarded Oct 9 at 16:25
Books on automata theory for self-study
Awarded Oct 9 at 14:30
What are some examples of decidable Nautral Problems outside of EEXP?
Awarded Oct 9 at 1:10
Time complexity of d-dimensional convex hull
Awarded Oct 8 at 14:19
Complexity of sorting
Awarded Sep 28 at 13:27
Are theoretically sound pseudorandom generators used in practice?
Awarded Sep 28 at 5:46
Equivalence of feasibility checking and optimization for linear systems
Awarded Sep 27 at 15:10
Recent advances in computer science since 2010?
Awarded Sep 25 at 16:26
Recent advances in computer science since 2010?
Awarded Sep 25 at 2:11
Recent advances in computer science since 2010?
Awarded Sep 24 at 11:41
Recent advances in computer science since 2010?
Awarded Sep 24 at 1:48
Recent advances in computer science since 2010?
Awarded Sep 24 at 1:48
Recent advances in computer science since 2010?
Awarded Sep 24 at 1:04
Circuit complexity of Majority function
Awarded Sep 23 at 12:16
Circuit complexity of Majority function
Awarded Sep 23 at 12:11
What is the smallest Turing machine where it is unknown if it halts or not?
Awarded Sep 23 at 6:32
Law of the Excluded Middle in complexity theory
Awarded Sep 21 at 20:56
Flood fill vs depth first search
Awarded Sep 13 at 19:15
How to efficiently read the theoretical computer science research papers?
Awarded Sep 10 at 8:06
Complexity of 1-or-3-in-3-SAT (odd-3-SAT)
Awarded Sep 6 at 5:50
Converting 2-ambiguous NFA to unambiguous NFA
Awarded Sep 4 at 8:42
Is bounded-error probabilistic computation sensitive to transition types?
Awarded Sep 1 at 10:32
Structural Complexity Theory References
Awarded Aug 24 at 10:43
What are examples of recent relatively simple 'toolbox algorithms'?
Awarded Aug 12 at 18:12
What are examples of recent relatively simple 'toolbox algorithms'?
Awarded Aug 12 at 15:55
What are examples of recent relatively simple 'toolbox algorithms'?
Awarded Aug 9 at 22:35
Dependent types over Church-encoded type in PTS/CoC
Awarded Aug 9 at 13:40
What are the differences between logical relations and simulations?
Awarded Aug 6 at 20:18
Stronger "induction" principles than induction-recursion
Awarded Aug 5 at 6:00
Quickly finding empty-string producing nonterminals in a CFG
Awarded Jul 31 at 14:03
What's the expressive power of Simply Typed Lambda calculus?
Awarded Jul 21 at 17:26
Is equivalence of unambiguous context-free languages decidable?
Awarded Jul 17 at 7:16
Is PARITY in QAC_0 (if that even makes sense)
Awarded Jul 13 at 15:42
Formulating P vs NP without Turing machines
Awarded Jul 5 at 8:20
What is the computational complexity of "solving" chess?
Awarded Jul 4 at 8:26
How large a treewidth can a tree plus half the edges have?
Awarded Jul 3 at 7:18
Which is the limit of lossless compression data? (if there exists such a limit)
Awarded Jun 30 at 10:17
Hardest optimization problems in NC
Awarded Jun 28 at 5:55
Why are so few natural candidates for NP-intermediate status?
Awarded Jun 24 at 10:03
Additive versus multiplicative accuracy
Awarded Jun 20 at 13:12
Solo single author paper vs the comfort of having you advisor on the paper?
Awarded Jun 19 at 8:47
What is the general consensus on the NL vs P question?
Awarded Jun 14 at 21:10
Why is the "balanced vs constant function" problem not a proof that P ≠ BPP?
Awarded May 27 at 20:07
Where is the model theory in programming language theory?
Awarded May 25 at 10:06
Where is the model theory in programming language theory?
Awarded May 23 at 9:51
Applications of Barendregt–Geuvers–Klop conjecture
Awarded May 16 at 2:56
Computational Complexity of Computer Vision Problems
Awarded May 15 at 9:00
Combinatorics of a badminton tournament
Awarded Apr 18 at 21:56
Implications of unprovability of $P\neq NP$
Awarded Apr 11 at 4:27
Theoretical Computer Science vs other Sciences?
Awarded Apr 9 at 18:21
Category theory and parsers --- references wanted
Awarded Apr 7 at 0:47
1
2 3 4 5
…
72

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.