Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It only takes a minute to sign up.

Sign up to join this community

Anybody can ask a question

Anybody can answer

The best answers are voted up and rise to the top

Explore our Questions

Ask Question

more tags

Active Hot Week Month

-1

votes

0

answers

12

views

A question about a consequence from a lemma

ds.algorithms graph-algorithms approximation-algorithms cg.comp-geom computational-geometry

asked 1 hour ago Jut 127

38

votes

2

answers

2k

views

Multiplying n polynomials of degree 1

ds.algorithms reference-request open-problem polynomials

modified Oct 20 at 7:50 Jan Johannsen 4,482

2

votes

0

answers

99

views

Fastest Known Algorithm for $k$-Dimensional Matching and $k$-Exact Cover

cc.complexity-theory ds.algorithms graph-algorithms parameterized-complexity exp-time-algorithms

modified Oct 16 at 16:55 Naysh 322

1

vote

1

answer

102

views

Are there an algorithm that find Minimum spanning tree in $O(n^2\log\log^*n)$?

ds.algorithms graph-theory graph-algorithms

answered Oct 16 at 7:26 David Eppstein 50k

-1

votes

2

answers

241

views

Partition a graph into two clusters

ds.algorithms graph-theory approximation-algorithms

modified Oct 15 at 12:51 Neal Young 7,397

5

votes

0

answers

72

views

Fine-Grained Hardness for Undirected Hamiltonicity

cc.complexity-theory ds.algorithms graph-algorithms hamiltonian-paths fine-grained

asked Oct 12 at 19:04 Naysh 322

1

vote

1

answer

114

views

Divide and Conquer Algorithm for 1-Median Problem

ds.algorithms lower-bounds clustering

modified Oct 6 at 11:04 Inuyasha Yagami 1,306

1

vote

0

answers

47

views

Decision tree vs. pebble game lower bounds

ds.algorithms soft-question lower-bounds

asked Sep 27 at 9:14 Siddharth 383

0

votes

0

answers

20

views

Fast algorithms for convex-convex quadratic fractional programming

ds.algorithms optimization

modified Sep 27 at 7:21 Evan Aad 304

10

votes

2

answers

1k

views

Counterexample to max-flow algorithms with irrational weights?

ds.algorithms graph-algorithms max-flow

modified Sep 20 at 17:12 Joshua Grochow 34.8k

1

vote

1

answer

203

views

Is this a novel technique for determining whether or not two rotated rectangles collide?

ds.algorithms reference-request cg.comp-geom

modified Sep 16 at 4:54 Erick Weber 37

13

votes

1

answer

492

views

Sorting with an average of $\mathrm{lg}(n!)+o(n)$ comparisons

cc.complexity-theory ds.algorithms sorting

modified Sep 10 at 22:05 Dmytro Taranovsky 2,202

2

votes

0

answers

88

views

How typical are odd-H-minor free graphs?

ds.algorithms graph-theory graph-algorithms treewidth

modified Sep 2 at 18:52 Yaroslav Bulatov 4,499

0

votes

0

answers

17

views

Fast filter for concurrent version vectors (vector clocks, lamport clocks) from a set

ds.algorithms dc.distributed-comp

asked Sep 1 at 11:17 Peter Jankuliak 101

Browse more Questions

Theoretical Computer Science Stack Exchange works best with JavaScript enabled