Theoretical Computer Science
vzn's user avatar
vzn's user avatar
vzn's user avatar
vzn
  • Member for 11 years, 4 months
  • Last seen more than 2 years ago
Profile Activity
Stats
10,856
reputation
521k
reached
272
answers
60
questions
Communities
View all
About

The algorithm designer who does not run experiments risks becoming lost in abstraction. —Sedgewick

Badges
View all badges
2
gold badges
30
silver badges
63
bronze badges
Top tags
View all tags
45
Score
85
Posts
26
Posts %
42
Score
36
Posts
11
Posts %
26
Score
61
Posts
18
Posts %
26
Score
34
Posts
10
Posts %
21
Score
105
Posts
32
Posts %
20
Score
50
Posts
15
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
28
Impact of Grothendieck's program on TCS
Nov 14, 2014
answer
28
Probabilistic (randomized) algorithms before "modern" computer science appeared
Sep 11, 2012
question
23
computing the minimal NFA for a DFA
Mar 23, 2012
answer
22
Implications of proof of abc conjecture for cs theory
Sep 11, 2012
answer
17
Why are perfect graphs called perfect?
Nov 21, 2012
question
16
What is the "nearest" problem to the Collatz conjecture that has been successfully resolved?
Jun 2, 2012
answer
15
Beautiful results in TCS
Feb 28, 2012
answer
13
Hardest known natural problem in P?
Feb 28, 2014
question
12
What's the correlation between treewidth and instance hardness for random 3-SAT?
Aug 9, 2013
question
12
L/P/PSpace vs P/NP
Aug 7, 2015
Top network posts
View all network posts
25
Examples of unexpected mathematical images
25
Are machine learning techniques "approximation algorithms"?
18
Is there a TM that halts on all inputs but that property is not provable?
16
Bridge theorems for group theory and formal languages
16
Why, really, is the Halting Problem so important?

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.