Theoretical Computer Science
SamM's user avatar
SamM's user avatar
SamM's user avatar
SamM
  • Member for 11 years, 8 months
  • Last seen this week
Profile Activity
Stats
1,685
reputation
24k
reached
23
answers
2
questions
Communities
View all
Badges
View all badges
2
gold badges
14
silver badges
21
bronze badges
Top tags
View all tags
53
Score
7
Posts
28
Posts %
50
Score
6
Posts
24
Posts %
42
Score
5
Posts
20
Posts %
18
Score
5
Posts
20
Posts %
10
Score
2
Posts
8
Posts %
8
Score
3
Posts
12
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
35
Are there any problems whose best known algorithm has run time $O\left(\frac{f(n)}{\log n}\right)$
Feb 3, 2013
question
15
Exponential Speedup in External Memory
Feb 4, 2013
answer
12
Does NP-completeness/hardness have to be constructive?
Dec 21, 2012
answer
11
Attempted proofs of P vs NP
Jun 2, 2019
answer
10
Is the problem of finding operators to satisfy a list of boolean variables NP complete?
Aug 12, 2012
answer
10
Complexity of Portal 2
Jul 7, 2012
answer
9
Expected number of random comparisons needed to sort a list
Oct 3, 2022
answer
7
Is this a known problem, and is it NP-complete?
Feb 9
answer
6
$O(m+n)$ really necessary for graph algorithms?
Aug 14, 2012
answer
5
Can any program be implemented mechanically?
Oct 31, 2012
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?
13
What stops me from pumping up my rating by playing a 200 game match against a much weaker (>400 point difference) player?
12
Is it decidable whether a TM reaches some position on the tape?

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.