Theoretical Computer Science Stack Exchange

4 votes

0 answers

89 views

$\log^\star n$ is somewhat common in runtimes. Does the superroot ever make an appearance?

templatetypedef

2,121

asked Nov 8 at 3:32

11 votes

1 answer

664 views

Is Gödel's speed-up theorem an instance of Blum's speedup theorem?

CommunityBot

1

modified Nov 3 at 0:04

10 votes

0 answers

141 views

Fine-grained complexity for game-type problems

Denis

8,598

modified Oct 11 at 14:58

57 votes

10 answers

18k views

Recent advances in computer science since 2010?

CommunityBot

1

modified Oct 6 at 11:19

0 votes

1 answer

74 views

Exchange cards with sum requirement

CommunityBot

1

modified Sep 24 at 10:06

29 votes

4 answers

1k views

Compendium of the Best Approximation and Hardness Results for NP optimization problems

a3nm

8,896

modified Sep 12 at 16:23

2 votes

4 answers

6k views

Complexity of greedy coloring

Markus

1

answered Sep 9 at 10:28

1 vote

0 answers

37 views

Understanding David Pisinger's balanced algorithm for the subset-sum problem with bounded weights

Pablo Messina

111

asked Sep 4 at 15:11

2 votes

0 answers

42 views

Effective algorithms for finite lattices of (higher-order) monotonous functions?

gasche

2,040

modified Aug 13 at 21:16

6 votes

1 answer

384 views

Given real numbers $x_1,...,x_n$ , find the maximum of $ \frac{(x_j-x_i)^2}{j-i}$

user3508551

1,078

modified Aug 12 at 22:42

20 votes

10 answers

3k views

What are examples of recent relatively simple 'toolbox algorithms'?

Jarek Duda

325

answered Aug 12 at 15:56

0 votes

0 answers

46 views

Deamortization of basic COLA (Cache oblivious lookahead array)

debasishg

1

asked Aug 12 at 7:09

4 votes

1 answer

1k views

Knapsack with dependent profits (pairs of items)

CommunityBot

1

modified Aug 11 at 17:01

4 votes

1 answer

85 views

Independent set queries with preprocessing

Laakeri

1,757

answered Aug 11 at 9:58

Stack Exchange Network

Explore our questions

$\log^\star n$ is somewhat common in runtimes. Does the superroot ever make an appearance?

Is Gödel's speed-up theorem an instance of Blum's speedup theorem?

Fine-grained complexity for game-type problems

Recent advances in computer science since 2010?

Exchange cards with sum requirement

Compendium of the Best Approximation and Hardness Results for NP optimization problems

Complexity of greedy coloring

Understanding David Pisinger's balanced algorithm for the subset-sum problem with bounded weights

Effective algorithms for finite lattices of (higher-order) monotonous functions?

Given real numbers $x_1,...,x_n$ , find the maximum of $ \frac{(x_j-x_i)^2}{j-i}$

What are examples of recent relatively simple 'toolbox algorithms'?

Deamortization of basic COLA (Cache oblivious lookahead array)

Knapsack with dependent profits (pairs of items)

Independent set queries with preprocessing

Hot Network Questions