Theoretical Computer Science
Meta user
Network profile
1,247
reputation
1
11
18

SamM

Apparently, this user prefers to keep an air of mystery about them.

19
answers
2
questions
~16k
people reached
  • mccauleysam.com
  • Member for 7 years, 6 months
  • 116 profile views
  • Last seen 10 hours ago

Communities (16)

Top network posts

Top tags (32)

Score 49
Posts 6
Posts % 29
Score 45
Posts 7
Score 35
Posts 4
Score 18
Posts 5
Score 9
Posts 2
Score 7
Posts 3
View all tags →

Top posts (21) 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
6 $O(m+n)$ really necessary for graph algorithms? Aug 14 '12
5 Can any program be implemented mechanically? Oct 31 '12
4 #EXP-Complete problems Apr 14 '14
4 Is there a generalization of the GO game that is known to be Turing complete? Apr 29 '15
4 Ordered-file maintenance Feb 17 '16
View all questions and answers →

Badges (30)

Gold

1

Rarest

Silver

11

Rarest

Bronze

18

Rarest

View all badges →