We changed our privacy policy. Read more.
Theoretical Computer Science
Ian
  • Member for 11 years, 1 month
Profile Activity
Stats
2,649
reputation
33k
reached
14
answers
3
questions
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (2)

Top Meta Posts
2
5

Top network posts

We respect a laser-like focus on one topic.

This user doesn’t have any gold badges yet.
17
silver badges
24
bronze badges
View all badges

Top tags (28)

Score 102
Posts 8
Posts % 47
Score 57
Posts 5
Score 49
Posts 3
Score 40
Posts 5
Score 38
Posts 2
Score 34
Posts 2
View all tags →

Top posts (17)

All Questions Answers
Votes Newest
32 The importance of Integrality Gap Aug 23 '10
31 Consequences of existence of a strongly polynomial algorithm for linear programming? Oct 13 '10
23 Can a computer simulate itself as part of a simulated world? Nov 12 '10
22 Bounds on $E[f(x)]$ in terms of $f(E[x])$ other than Jensen's inequality? Aug 27 '10
22 Is APX contained in NP? Aug 19 '10
17 The structure of pathological instances for simplex algorithms Oct 27 '10
17 Alternate notion of complexity based on gap between brute-force and the best algorithm? Aug 19 '10
17 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
15 what is easy for minor-excluded graphs? Oct 23 '10
View all questions and answers →

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.