User Rune - MathOverflow

Rune

Member for 14 years, 6 months

Network profile

9 Questions

Score Activity Newest Views

51 votes

4 answers

17k views

How hard is it to compute the number of prime factors of a given integer?

asked Nov 2, 2009 at 17:25

24 votes

1 answer

18k views

How hard is it to compute the Euler totient function?

asked Oct 29, 2009 at 15:45

24 votes

4 answers

4k views

Super-linear time complexity lower bounds for any natural problem in NP?

asked Nov 11, 2009 at 0:27

18 votes

4 answers

20k views

Efficiently sampling points uniformly from the surface of an n-sphere

asked May 15, 2010 at 3:34

9 votes

4 answers

2k views

Algorithms on graphs of bounded degeneracy/arboricity

asked Jan 2, 2010 at 5:04

9 votes

10 answers

2k views

Interesting families of sparse graphs?

asked Oct 23, 2009 at 14:30

5 votes

3 answers

1k views

Erdős–Stone theorem type edge density estimates for bipartite graphs?

asked Nov 10, 2009 at 4:07

4 votes

3 answers

417 views

A name for a claw-graph with paths attached to it

asked Nov 1, 2009 at 13:54

1 vote

4 answers

3k views

A subset of all languages which is uncountable?

asked Nov 3, 2009 at 0:20