Theoretical Computer Science
Meta user
Network profile
8,480
reputation
2
25
55

vzn

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

272
answers
60
questions
~443k
people reached
  • U.S.
  • vzn1.wordpress.com
  • Member for 7 years, 5 months
  • 4,076 profile views
  • Last seen May 30 at 21:15

Communities (56)

Top Meta Posts
3
9

Top network posts

Top tags (199)

Score 41
Posts 85
Posts % 26
Score 41
Posts 36
Score 26
Posts 34
Score 22
Posts 105
Score 20
Posts 61
Score 15
Posts 50
View all tags →

Top posts (332) All Questions Answers | Votes Newest

27 Impact of Grothendieck's program on TCS Nov 14 '14
27 Probabilistic (randomized) algorithms before “modern” computer science appeared Sep 11 '12
22 Implications of proof of abc conjecture for cs theory Sep 11 '12
17 computing the minimal NFA for a DFA Mar 23 '12
16 Why are perfect graphs called perfect? Nov 21 '12
14 What is the “nearest” problem to the Collatz conjecture that has been successfully resolved? Jun 2 '12
14 Beautiful results in TCS Feb 28 '12
12 L/P/PSpace vs P/NP Aug 7 '15
12 What CS blogs should everyone read? Apr 21 '14
12 Statements that imply $\mathbf{P}\neq \mathbf{NP}$ Oct 13 '14
View all questions and answers →

Badges (82)

Gold

2

Rarest

Silver

25

Rarest

Bronze

55

Rarest

View all badges →