Computer Science Stack Exchange

6 votes

0 answers

91 views

+100

Complexity of frog game on graphs is exponential, or can we do better?

Vepir

75

modified 4 hours ago

0 votes

0 answers

14 views

Sum of coprime divisors

MC From Scratch

133

asked 4 hours ago

3 votes

1 answer

52 views

Counting integers $n \leq x$ with a given prime signature

D.W.♦

145k

answered yesterday

1 vote

0 answers

33 views

Product of all possible ranges in a sequence

Yuval Filmus

271k

modified yesterday

-1 votes

0 answers

13 views

Asymptotic Practices

Mar17

1

asked 2 days ago

0 votes

1 answer

45 views

In merge sort, what will be the time complexity if in each recursion, we break the array in two parts of size 1/4 and 3/4 respectively?

Steven

24.5k

modified Oct 3 at 14:34

1 vote

1 answer

35 views

Best known deterministic algorithm for generation of any (non random) n-bit prime?

Somnium

265

modified Oct 3 at 8:45

1 vote

1 answer

69 views

Show that $TIME(\sqrt{n})$ = $TIME(1)$

Yuval Filmus

271k

modified Oct 2 at 20:19

5 votes

3 answers

4k views

Is there a faster than O(n^2) way to compute a vector of length n from another vector and an n by n matrix?

Peter Cordes

831

modified Oct 2 at 18:22

1 vote

1 answer

498 views

Complexity of edit distance with block operations

Glorfindel

724

modified Oct 2 at 18:20

0 votes

1 answer

61 views

How do I determine the time and space complexity of the following algorithm?

CommunityBot

1

modified Oct 2 at 14:05

0 votes

1 answer

25 views

Is there a possibility to convert the following problem into divide and connquer

V.V.

51

answered Oct 2 at 9:47

4 votes

1 answer

83 views

Optimal algorithmic complexity of "a nonrepetitive stack"?

John L.

35.5k

modified Oct 2 at 4:27

2 votes

1 answer

33 views

Sieve of Eratosthenes for factorization: bitwise complexity?

pcpthm

1,511

answered Oct 1 at 10:01

Stack Exchange Network

Explore our questions

Complexity of frog game on graphs is exponential, or can we do better?

Sum of coprime divisors

Counting integers $n \leq x$ with a given prime signature

Product of all possible ranges in a sequence

Asymptotic Practices

In merge sort, what will be the time complexity if in each recursion, we break the array in two parts of size 1/4 and 3/4 respectively?

Best known deterministic algorithm for generation of any (non random) n-bit prime?

Show that $TIME(\sqrt{n})$ = $TIME(1)$

Is there a faster than O(n^2) way to compute a vector of length n from another vector and an n by n matrix?

Complexity of edit distance with block operations

How do I determine the time and space complexity of the following algorithm?

Is there a possibility to convert the following problem into divide and connquer

Optimal algorithmic complexity of "a nonrepetitive stack"?

Sieve of Eratosthenes for factorization: bitwise complexity?

Hot Network Questions