Theoretical Computer Science
usul
  • Member for 9 years, 8 months
Profile Activity
Stats
6,929
reputation
74k
reached
94
answers
10
questions
Communities
View all
Badges
View all badges
1
gold badge
20
silver badges
41
bronze badges
Top tags
View all 112 tags
203
Score
31
Posts
30
Posts %
51
Score
9
Posts
9
Posts %
43
Score
10
Posts
10
Posts %
35
Score
8
Posts
8
Posts %
32
Score
15
Posts
14
Posts %
30
Score
10
Posts
10
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
26
When does (or should) Theoretical CS care about intuitionistic proofs?
May 20 '13
22
Did Alan Turing's student Robin Gandy assert that Charles Babbage had no notion of a universal computing machine?
Sep 3 '19
22
Implications of proving NP=RP on complexity theory
Aug 5 '20
20
Examples of successful derandomization from BPP to P
Mar 23 '16
19
Is it enough for linear program constraints to be satisfied in expectation?
Dec 10 '12
17
Is BPP vs. P a real problem after we know BPP lies in P/poly?
Oct 6 '17
16
Suppose $\mathbf{P} = \mathbf{BQP}$. Then what is randomness? Would it even exist at all?
May 17 '15
16
Are vertex colourings--in a sense--edge colourings?
Feb 18 '13
15
What is a natural problem in theory of computation?
Aug 25 '19
14
White elephant gift exchanges: mechanisms for fair division
Dec 15 '12
Top network posts
View all
66
Why do roots of polynomials tend to have absolute value close to 1?
56
How to deal with low-probability high-impact risks?
50
Why doesn't Cantor's diagonal argument also apply to natural numbers?
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.