Skip to main content
Computer Science
SamM's user avatar
SamM's user avatar
SamM's user avatar
SamM
  • Member for 12 years, 5 months
  • Last seen more than a week ago
Profile Activity
Stats
1,702
reputation
104k
reached
24
answers
2
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
13
silver badges
20
bronze badges
Top tags
View all tags
55
Score
9
Posts
35
Posts %
38
Score
6
Posts
23
Posts %
28
Score
4
Posts
15
Posts %
26
Score
5
Posts
19
Posts %
26
Score
3
Posts
12
Posts %
24
Score
2
Posts
8
Posts %
Top posts
View all questions and answers
answer
15
Generalised 3SUM (k-SUM) problem?
Aug 1, 2012
answer
14
How can it be detected that a number generator is not really random?
Jan 3, 2013
answer
14
Is O(mn) considered "linear" or "quadratic" growth?
Feb 7, 2013
answer
12
Is it decidable whether a TM reaches some position on the tape?
Aug 11, 2012
answer
12
Two functions $g(n)$, $G(n)$ such that $g(n) = o(G(n))$ but $g(n+1) \neq o(G(n))$
Nov 26, 2012
answer
12
Why is $3^n = 2^{O(n)}$ true?
Dec 1, 2012
answer
9
Relation between interactive proof systems (IP), NP, coNP, PSPACE
Nov 15, 2012
answer
8
Base of logarithm in runtime of Prim's and Kruskal's algorithms
Nov 1, 2012
question
6
Finding a perfect matching using an LP
Sep 2, 2014
answer
5
Is it intuitive to see that finding a Hamiltonian path is not in P while finding Euler path is?
Jul 21, 2012
Top network posts
View all network posts
35
Are there any problems whose best known algorithm has run time $O\left(\frac{f(n)}{\log n}\right)$
15
Exponential Speedup in External Memory
13
What stops me from pumping up my rating by playing a 200 game match against a much weaker (>400 point difference) player?
12
Does NP-completeness/hardness have to be constructive?
11
Attempted proofs of P vs NP