Computer Science
SamM
  • Member for 9 years, 4 months
  • Last seen this week
Profile Activity
Stats
1,662
reputation
85k
reached
24
answers
2
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
13
silver badges
18
bronze badges
Top tags
View all tags
53
Score
9
Posts
35
Posts %
37
Score
6
Posts
23
Posts %
27
Score
4
Posts
15
Posts %
25
Score
5
Posts
19
Posts %
25
Score
3
Posts
12
Posts %
22
Score
2
Posts
8
Posts %
Top posts
View all questions, answers, and articles
All Questions Answers Articles
Votes Newest
15
How can it be detected that a number generator is not really random?
Jan 3 '13
14
Generalised 3SUM (k-SUM) problem?
Aug 1 '12
13
Is O(mn) considered "linear" or "quadratic" growth?
Feb 7 '13
12
Why is $3^n = 2^{O(n)}$ true?
Dec 1 '12
12
Two functions $g(n)$, $G(n)$ such that $g(n) = o(G(n))$ but $g(n+1) \neq o(G(n))$
Nov 26 '12
10
Is it decidable whether a TM reaches some position on the tape?
Aug 11 '12
8
Relation between interactive proof systems (IP), NP, coNP, PSPACE
Nov 15 '12
8
Base of logarithm in runtime of Prim's and Kruskal's algorithms
Nov 1 '12
6
Finding a perfect matching using an LP
Sep 2 '14
5
What is the relationship between NP/NP-Complete/NP-Hard to time complexity?
Oct 11 '12
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
12
Does NP-completeness/hardness have to be constructive?
10
Complexity of Portal 2
10
Is the problem of finding operators to satisfy a list of boolean variables NP complete?

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.