2022 Developer Survey is open! Take survey.
Theoretical Computer Science
user avatar
user avatar
user avatar
usul
  • Member for 10 years, 3 months
  • Last seen this week
Profile Activity
Stats
7,022
reputation
78k
reached
95
answers
10
questions
Communities
View all
Badges
View all badges
1
gold badge
22
silver badges
42
bronze badges
Top tags
View all tags
204
Score
31
Posts
30
Posts %
51
Score
9
Posts
9
Posts %
43
Score
10
Posts
10
Posts %
39
Score
8
Posts
8
Posts %
32
Score
15
Posts
14
Posts %
32
Score
11
Posts
10
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
26
When does (or should) Theoretical CS care about intuitionistic proofs?
May 20, 2013
answer
22
Did Alan Turing's student Robin Gandy assert that Charles Babbage had no notion of a universal computing machine?
Sep 3, 2019
answer
22
Implications of proving NP=RP on complexity theory
Aug 5, 2020
answer
20
Examples of successful derandomization from BPP to P
Mar 23, 2016
answer
19
Is it enough for linear program constraints to be satisfied in expectation?
Dec 10, 2012
answer
18
Is BPP vs. P a real problem after we know BPP lies in P/poly?
Oct 6, 2017
answer
16
Suppose $\mathbf{P} = \mathbf{BQP}$. Then what is randomness? Would it even exist at all?
May 17, 2015
answer
16
Are vertex colourings--in a sense--edge colourings?
Feb 18, 2013
answer
15
What is a natural problem in theory of computation?
Aug 25, 2019
answer
14
White elephant gift exchanges: mechanisms for fair division
Dec 15, 2012
Top network posts
View all network posts
73
Why do roots of polynomials tend to have absolute value close to 1?
57
Why doesn't Cantor's diagonal argument also apply to natural numbers?
56
How to deal with low-probability high-impact risks?
47
What exactly (and precisely) is "hash?"
39
Pressure to defend the relevance of one's area of mathematics

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.