Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. 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

6 votes
0 answers
91 views
+100

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

0 votes
0 answers
14 views

Sum of coprime divisors

3 votes
1 answer
52 views

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

1 vote
0 answers
33 views

Product of all possible ranges in a sequence

-1 votes
0 answers
13 views

Asymptotic Practices

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?

1 vote
1 answer
35 views

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

1 vote
1 answer
69 views

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

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?

1 vote
1 answer
498 views

Complexity of edit distance with block operations

0 votes
1 answer
61 views

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

0 votes
1 answer
25 views

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

4 votes
1 answer
83 views

Optimal algorithmic complexity of "a nonrepetitive stack"?

2 votes
1 answer
33 views

Sieve of Eratosthenes for factorization: bitwise complexity?

Browse more Questions