Theoretical Computer Science Stack Exchange

2

votes

1

answer

48

views

What is the maximal load of a “latency-bounded” Cuckoo Hash?

ds.algorithms randomized-algorithms hash-function

answered yesterday jbapple 4,209

0

votes

1

answer

102

views

Is it possible to prove that a general purpose integer factorization algorithm must contain a loop?

ds.algorithms factoring heuristics

modified Jun 19 at 19:52 orgesleka 266

17

votes

3

answers

768

views

Computing sum of sparse polynomials squared in O(n log n) time?

ds.algorithms algebra polynomials

answered Jun 16 at 10:22 Thomas Ahle 353

0

votes

0

answers

79

views

Is it possible to sort by only knowing the sign of pairwise sums?

cc.complexity-theory ds.algorithms sorting

modified Jun 14 at 8:09 multiplex 6

-3

votes

0

answers

27

views

minimum cost spanning tree algorithm with benchmark graphs

ds.algorithms

asked Jun 13 at 9:29 Jasmine Priskilla 1

5

votes

1

answer

329

views

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

ds.algorithms machine-learning

modified Jun 8 at 0:05 Community♦ 1

1

vote

1

answer

86

views

How many samples are needed to reconstruct a path?

ds.algorithms graph-theory graph-algorithms machine-learning sample-complexity

answered May 28 at 16:14 Emil Jeřábek 10.4k

3

votes

2

answers

869

views

Subset-sum-difference problem

ds.algorithms

modified May 24 at 23:33 Craig Feinstein 225

0

votes

0

answers

45

views

Mapping of entire balls using Locality Sensitive Hashing (LSH)

ds.algorithms pr.probability computational-geometry

modified May 23 at 21:27 R B 6,286

3

votes

0

answers

215

views

Convention for RAM machine models

cc.complexity-theory ds.algorithms machine-models

modified May 22 at 19:09 ghosts_in_the_code 143

5

votes

0

answers

157

views

Is there a fast algorithm for inverting a sparse matrix?

ds.algorithms linear-algebra

modified May 20 at 10:10 Jan Johannsen 3,894

8

votes

1

answer

353

views

What is the hardest instance for the group isomorphism problem?

ds.algorithms gr.group-theory

modified May 12 at 14:35 Joshua Grochow 30.2k

7

votes

2

answers

180

views

Determining how n-tuples are sorted as you search them?

ds.algorithms

modified May 11 at 18:54 xavierm02 451

-1

votes

1

answer

50

views

How is additive error handled in this simple algorithm? 'Product of all elements'

ds.algorithms approximation-algorithms upper-bounds analysis-of-algorithms

modified May 7 at 21:16 Soumya Basu 46

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore Our Questions

What is the maximal load of a “latency-bounded” Cuckoo Hash?

Is it possible to prove that a general purpose integer factorization algorithm must contain a loop?

Computing sum of sparse polynomials squared in O(n log n) time?

Is it possible to sort by only knowing the sign of pairwise sums?

minimum cost spanning tree algorithm with benchmark graphs

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

How many samples are needed to reconstruct a path?

Subset-sum-difference problem

Mapping of entire balls using Locality Sensitive Hashing (LSH)

Convention for RAM machine models

Is there a fast algorithm for inverting a sparse matrix?

What is the hardest instance for the group isomorphism problem?

Determining how n-tuples are sorted as you search them?

How is additive error handled in this simple algorithm? 'Product of all elements'

Hot Network Questions