Theoretical Computer Science
SamM
  • Member for 9 years, 10 months
  • Last seen this week
Profile Activity
Stats
1,407
reputation
19k
reached
19
answers
2
questions
Communities
View all
Badges
View all badges
1
gold badge
12
silver badges
18
bronze badges
Top tags
View all tags
50
Score
7
Posts
33
Posts %
50
Score
6
Posts
29
Posts %
35
Score
4
Posts
19
Posts %
18
Score
5
Posts
24
Posts %
9
Score
2
Posts
10
Posts %
8
Score
3
Posts
14
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
35
Are there any problems whose best known algorithm has run time $O\left(\frac{f(n)}{\log n}\right)$
Feb 3 '13
15
Exponential Speedup in External Memory
Feb 4 '13
12
Does NP-completeness/hardness have to be constructive?
Dec 21 '12
10
Is the problem of finding operators to satisfy a list of boolean variables NP complete?
Aug 12 '12
10
Complexity of Portal 2
Jul 7 '12
8
Attempted proofs of P vs NP
Jun 2 '19
6
$O(m+n)$ really necessary for graph algorithms?
Aug 14 '12
5
Can any program be implemented mechanically?
Oct 31 '12
4
A counting subset sum problem with fixed subset size and bounded weights
Jul 8 '12
4
#EXP-Complete problems
Apr 14 '14
Top network posts
View all network posts
15
Generalised 3SUM (k-SUM) problem?
15
How can it be detected that a number generator is not really random?
14
Is O(mn) considered "linear" or "quadratic" growth?
12
Two functions $g(n)$, $G(n)$ such that $g(n) = o(G(n))$ but $g(n+1) \neq o(G(n))$
12
Why is $3^n = 2^{O(n)}$ true?

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.