Theoretical Computer Science
Kristoffer Arnsfelt Hansen's user avatar
Kristoffer Arnsfelt Hansen's user avatar
Kristoffer Arnsfelt Hansen's user avatar
Kristoffer Arnsfelt Hansen
  • Member for 13 years, 3 months
  • Last seen more than a week ago
Profile Activity
Stats
4,129
reputation
44k
reached
40
answers
0
questions
Communities
View all
About

Researcher in Computer Science

Badges
View all badges
2
gold badges
26
silver badges
36
bronze badges
Top tags
View all tags
245
Score
24
Posts
60
Posts %
137
Score
12
Posts
30
Posts %
82
Score
7
Posts
18
Posts %
47
Score
4
Posts
10
Posts %
45
Score
4
Posts
10
Posts %
42
Score
4
Posts
10
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
22
Can we count in depth $\frac{\lg n}{\lg \lg n}$?
Oct 9, 2012
answer
22
How much time to recognize palindromes in logarithmic space?
Mar 3, 2014
answer
21
Guidelines to reduce general TSP to Triangle TSP
Oct 22, 2012
answer
20
Is qsort linear when sorting only two values?
Feb 5, 2011
answer
18
Better lower bounds than 3n for non-boolean functions?
Mar 6, 2014
answer
16
Relationship between SPACE(n) and E
Sep 23, 2010
answer
16
A fixed-depth characterization of $TC^0$? $NC^1$?
Oct 31, 2010
answer
15
Does the $\mathsf{TC^0}$ hierarchy collapse?
Jun 11, 2013
answer
14
Does L have a definition in terms of circuits?
Dec 2, 2010
answer
13
What is the complexity class most closely associated with what the human mind can accomplish quickly?
Mar 9, 2011
Top network posts
View all network posts
196
Why is \[ ... \] preferable to $$ ... $$?
79
Avoiding jumping frames in beamer
34
What is the meaning of $O(m+n)$?
16
Graphing sine function in MetaPost
9
Depth-2 circuits with OR and MOD gates are not universal?

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.