Stack Exchange

Kristoffer Arnsfelt Hansen

Århus, Denmark

cs.au.dk/~arnsfelt

Age: 33

Researcher in Computer Science

top accounts reputation activity favorites subscriptions
Top Questions
Top Answers
95
Why is \[ … \] preferable to $$ … $$?
tex.stackexchange.com

20
Is qsort linear when sorting only two values?
cstheory.stackexchange.com

16
Can we count in depth $\frac{\lg n}{\lg \lg n}$?
cstheory.stackexchange.com

15
Relationship between SPACE(n) and E
cstheory.stackexchange.com

14
Graphing sine function in MetaPost
tex.stackexchange.com

13
What is the meaning of $O(m+n)$?
cs.stackexchange.com

12
A fixed-depth characterization of $TC^0$? $NC^1$?
cstheory.stackexchange.com

11
Parity and $AC^0$
cstheory.stackexchange.com

11
Does L have a definition in terms of circuits?
cstheory.stackexchange.com

11
Guidelines to reduce general TSP to Triangle TSP
cstheory.stackexchange.com

9
Is it possible to use random restrictions to obtain a lower-bound for $\mathsf{TC^0}$?
cstheory.stackexchange.com

8
Depth-2 circuits with OR and MOD gates are not universal?
cs.stackexchange.com

7
Is the Balanced Boolean Formula problem solvable in sublogarithmic space if the input has a tree structure?
cstheory.stackexchange.com

7
What is the complexity class most closely associated with what the human mind can accomplish quickly?
cstheory.stackexchange.com

7
“Steve's class”: origin of SC
cstheory.stackexchange.com

7
Constant Depth Circuit Computing Threshold Function
cstheory.stackexchange.com

7
What is $DTIME(n^a)^{DTIME(n^b)}$?
cstheory.stackexchange.com

6
Simple question about pseudorandom generator
cstheory.stackexchange.com

5
Decidability of transcendental numbers
cstheory.stackexchange.com