Theoretical Computer Science Stack Exchange

0

votes

0

answers

6

views

No cyclical variable references within a for-loop = enough?

ds.algorithms pl.programming-languages turing-machines machine-models

modified 9 hours ago EnjoysMath 148

0

votes

1

answer

52

views

About learning a single Gaussian in total-variation distance

ds.algorithms machine-learning lg.learning st.statistics

modified yesterday Clement C. 2,111

5

votes

1

answer

217

views

Evaluation of an arithmetic formula where the time depends on the length of the arguments of gates

ds.algorithms arithmetic-circuits

modified yesterday Chao Xu 2,914

7

votes

1

answer

101

views

Smoothed analysis to compare algorithms

ds.algorithms approximation-algorithms smoothed-analysis

answered Feb 11 at 11:40 Bodo Manthey 355

5

votes

1

answer

311

views

Solving “all-marginals” problem for independent sets on grid

ds.algorithms machine-learning

modified Feb 8 at 0:02 Community♦ 1

6

votes

0

answers

137

views

Bottleneck $k$-link path in a complete DAG

ds.algorithms

modified Jan 29 at 20:33 Chao Xu 2,914

3

votes

0

answers

52

views

Conjugacy testing problem

cc.complexity-theory ds.algorithms

modified Jan 29 at 18:01 aaaa 28

6

votes

3

answers

304

views

Linear Time Maximum Clearance Computation on a Grid Graph?

ds.algorithms cg.comp-geom

modified Jan 25 at 0:20 user30448 129

29

votes

1

answer

1k

views

Finding a biased coin using a few coin tosses

ds.algorithms pr.probability

modified Jan 24 at 9:02 user30448 129

5

votes

0

answers

158

views

What's the fastest known algorithm for finding the diameter of a graph?

ds.algorithms graph-theory

modified Jan 21 at 21:40 GEP 47

2

votes

0

answers

64

views

What is the competitive ratio of a $d$-way associative LRU cache?

ds.algorithms approximation-algorithms online-algorithms competitive-ratio

asked Jan 14 at 20:34 R B 6,288

20

votes

4

answers

1k

views

Positive topological ordering, take 3

ds.algorithms np-hardness open-problem matrices

answered Jan 14 at 17:04 ORILL_Code 1

20

votes

1

answer

2k

views

Finding the distance between two polynomials (represented as trees)

ds.algorithms tree ai.artificial-intel genetic-programming

modified Jan 8 at 19:34 Glorfindel 157

17

votes

3

answers

431

views

Is there a constant factor approximation algorithm for 2D rectangle coloring problem?

ds.algorithms approximation-algorithms cg.comp-geom graph-colouring online-algorithms

modified Jan 7 at 8:34 Glorfindel 157

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore Our Questions

No cyclical variable references within a for-loop = enough?

About learning a single Gaussian in total-variation distance

Evaluation of an arithmetic formula where the time depends on the length of the arguments of gates

Smoothed analysis to compare algorithms

Solving “all-marginals” problem for independent sets on grid

Bottleneck $k$-link path in a complete DAG

Conjugacy testing problem

Linear Time Maximum Clearance Computation on a Grid Graph?

Finding a biased coin using a few coin tosses

What's the fastest known algorithm for finding the diameter of a graph?

What is the competitive ratio of a $d$-way associative LRU cache?

Positive topological ordering, take 3

Finding the distance between two polynomials (represented as trees)

Is there a constant factor approximation algorithm for 2D rectangle coloring problem?

Hot Network Questions