List questions from computational-complexity

Published on 29 Mar 2026 - 7:19

64

Views

Prove that $S_2$ is closed under union and complement

Published on 16 Jun 2015 - 17:37

2.2k

Views

Find the asymptotic tight bound for $T(n)=T(n-1)+n lg n + n$ and for $T(n)=n^2 \sqrt{n}T(\sqrt{n})+n^5lg^3n+lg^5n$

Published on 29 Mar 2026 - 5:44

1.6k

Views

Is finding generators of finite fields hard?

Published on 20 Jun 2015 - 11:22

191

Views

What background is needed to study quantum game theory?

Published on 20 Jun 2015 - 18:39

108

Views

Is there any sort algorithm quicker than Quicksort given a random array of integers?

Published on 30 Mar 2026 - 15:10

171

Views

Complexity of $\binom{n}{2}$

Published on 22 Jun 2015 - 21:21

97

Views

A quicker algorithm.

Published on 24 Jun 2015 - 13:04

450

Views

Prove correctness of simple greedy algorithm to find max

Published on 25 Jun 2015 - 14:34

1.4k

Views

Computing the Log-Euclidean distance efficiently by using eigen-analysis.

Published on 25 Jun 2015 - 21:44

374

Views

How to properly detect rows to be swapped in a Gaussian elimination?

Published on 27 Mar 2026 - 0:58

90

Views

Problem with my simple algorithm to count repetitions

Published on 26 Jun 2015 - 15:32

396

Views

max degree polynomial for time complexity considerations

Published on 26 Mar 2026 - 18:58

51

Views

How many coins do we need to get $k$ amount

Published on 01 Apr 2026 - 10:42

220

Views

Why aren't all NP-complete problems strongly NP-complete, if any NP problem can be reduced to an NP-complete problem

Published on 26 Mar 2026 - 19:00

List Question

Is there an algorithm to find minimum number of undefinable words in a dictionary?

Prove that $S_2$ is closed under union and complement

Find the asymptotic tight bound for $T(n)=T(n-1)+n lg n + n$ and for $T(n)=n^2 \sqrt{n}T(\sqrt{n})+n^5lg^3n+lg^5n$

Is finding generators of finite fields hard?

What background is needed to study quantum game theory?

Is there any sort algorithm quicker than Quicksort given a random array of integers?

Complexity of $\binom{n}{2}$

A quicker algorithm.

Prove correctness of simple greedy algorithm to find max

Computing the Log-Euclidean distance efficiently by using eigen-analysis.

How to properly detect rows to be swapped in a Gaussian elimination?

Problem with my simple algorithm to count repetitions

max degree polynomial for time complexity considerations

How many coins do we need to get $k$ amount

Why aren't all NP-complete problems strongly NP-complete, if any NP problem can be reduced to an NP-complete problem

Trending Questions

Popular # Hahtags

Popular Questions