Stack Exchange

Kristoffer Arnsfelt Hansen

Århus, Denmark

http://www.cs.au.dk/~arnsfelt

Researcher in Computer Science

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

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

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

22
How much time to recognize palindromes in logarithmic space?
cstheory.stackexchange.com

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

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

18
Better lower bounds than 3n for non-boolean functions?
cstheory.stackexchange.com

16
Graphing sine function in MetaPost
tex.stackexchange.com

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

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

15
Does the $\mathsf{TC^0}$ hierarchy collapse?
cstheory.stackexchange.com

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

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

13
Hamiltonian cycle on graphs without small cycles
cstheory.stackexchange.com

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

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

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

9
Circuit complexity of Majority function
cstheory.stackexchange.com

8
Parallel algorithms for directed st-connectivity
cstheory.stackexchange.com

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

8
Equivalence of feasibility checking and optimization for linear systems
cstheory.stackexchange.com

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

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

7
Simple reduction to unbounded knapsack?
cstheory.stackexchange.com

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

7
Topological sort with constraints on the relative difference between the vertex labels
cstheory.stackexchange.com

6
Simple question about pseudorandom generator
cstheory.stackexchange.com

6
Solving Linear Equations over $Z_q$
cstheory.stackexchange.com

6
Subgraph containing all nodes and edges that are part of length-limited simple s-t paths in a digraph
cstheory.stackexchange.com

6
Gap in degree of representations of candidate boolean functions
cstheory.stackexchange.com

1 2