9

Questions
votes newest views recent
 
4
votes
4
answers
3k
views

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

may 15 10 at 4:59 Igor Pak 8,206●2●17●57

1
7
votes
4
answers
819
views

Algorithms on graphs of bounded degeneracy/arboricity

may 8 12 at 11:24 Martin Vatshelle 1

3
8
votes
4
answers
1k
views

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

jun 10 10 at 15:44 Timothy Chow 14.5k●1●68●137

4
4
votes
3
answers
640
views

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

nov 10 09 at 22:10 Boris Bukh 3,032●9●26

 
1
vote
4
answers
1k
views

A subset of all languages which is uncountable?

nov 30 10 at 8:48 none 1●1

10
28
votes
4
answers
4k
views

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

dec 28 10 at 1:08 Petrus 1●2

1
3
votes
3
answers
329
views

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

apr 23 10 at 15:30 Charles Stewart 1,669●8●15

2
9
votes
1
answer
5k
views

How hard is it to compute the Euler totient function?

feb 27 12 at 0:14 aorq 2,470●17●36

3
7
votes
10
answers
2k
views

Interesting families of sparse graphs?

jan 17 at 1:52 Chris Godsil 5,684●1●8●22