We’re rewarding the question askers & reputations are being recalculated! Read more.
Theoretical Computer Science
Meta user
Network profile
2,579
reputation
15
24

Ian

Apparently, this user prefers to keep an air of mystery about them.

14
answers
3
questions
~28k
people reached
  • Member for 9 years, 3 months
  • 264 profile views
  • Last seen Aug 1 '11 at 4:37

Communities (2)

Top Meta Posts
2
5

Top network posts

We respect a laser-like focus on one topic.

Top tags (28)

Score 97
Posts 8
Posts % 47
Score 55
Posts 5
Score 46
Posts 3
Score 39
Posts 5
Score 36
Posts 2
Score 34
Posts 2
View all tags →

Top posts (17) All Questions Answers | Votes Newest

31 Consequences of existence of a strongly polynomial algorithm for linear programming? Oct 13 '10
30 The importance of Integrality Gap Aug 23 '10
23 Can a computer simulate itself as part of a simulated world? Nov 12 '10
21 Bounds on $E[f(x)]$ in terms of $f(E[x])$ other than Jensen's inequality? Aug 27 '10
20 Is APX contained in NP? Aug 19 '10
17 Alternate notion of complexity based on gap between brute-force and the best algorithm? Aug 19 '10
16 Kolmogorov complexity applications in computational complexity Aug 19 '10
16 Are there alternatives to using polynomials in defining the different notions of efficient computation? Aug 24 '10
16 The structure of pathological instances for simplex algorithms Oct 27 '10
15 what is easy for minor-excluded graphs? Oct 23 '10
View all questions and answers →

Badges (39)

Gold

—

Silver

15

Rarest

Bronze

24

Rarest

View all badges →