List questions from computational-complexity

Published on 24 Apr 2015 - 11:26

783

Views

How to find a function that is the upper bound of this sum?

Published on 25 Apr 2015 - 21:50

83

Views

Complexity of finding set of sets with maximum cardinality and constrained coverage.

Published on 28 Apr 2015 - 23:00

20

Views

Given $L = L_1 \cap L_2$ where $L_1 \in NP$ and $L_2 \in coNP$, how do I express L as a symmetric difference of 2 sets in NP?

Published on 30 Apr 2015 - 9:28

328

Views

Quick solution check for the TSP

Published on 01 May 2015 - 1:33

126

Views

An easy question about NP-hard

Published on 26 Mar 2026 - 17:30

460

Views

Is showing a graph is non-Hamiltonian NP-Complete?

Published on 26 Mar 2026 - 17:31

87

Views

Why is $O(n^{km}+n^m)=O(n^{km})$?

Published on 03 May 2015 - 22:48

25.6k

Views

Approximation of combination $ {n \choose k} = \Theta \left( n^k \right) $?

Published on 03 May 2015 - 23:45

53

Views

How to approximate a trigonometric to make less computation complexity

Published on 04 May 2015 - 7:23

403

Views

Coppersmith-Winograd algorithm

Published on 29 Mar 2026 - 4:11

56

Views

Proving a language $L$ is in $\mathrm{co\text{-}NP}$ if $| L \cap \{0,1\}^n | \in \operatorname{poly}(n)$ for all $n$

Published on 04 May 2015 - 8:16

983

Views

Wouldn't each addition take time $O(n)$?

Published on 06 May 2015 - 0:11

78

Views

Simplicial maps between simplicial 2-manifolds

Published on 27 Mar 2026 - 1:44

208

Views

What do log-equivalent and log-complete mean?

Published on 10 May 2015 - 3:58

List Question

Verifying whether a number is the determinant of a matrix

How to find a function that is the upper bound of this sum?

Complexity of finding set of sets with maximum cardinality and constrained coverage.

Given $L = L_1 \cap L_2$ where $L_1 \in NP$ and $L_2 \in coNP$, how do I express L as a symmetric difference of 2 sets in NP?

Quick solution check for the TSP

An easy question about NP-hard

Is showing a graph is non-Hamiltonian NP-Complete?

Why is $O(n^{km}+n^m)=O(n^{km})$?

Approximation of combination $ {n \choose k} = \Theta \left( n^k \right) $?

How to approximate a trigonometric to make less computation complexity

Coppersmith-Winograd algorithm

Proving a language $L$ is in $\mathrm{co\text{-}NP}$ if $| L \cap \{0,1\}^n | \in \operatorname{poly}(n)$ for all $n$

Wouldn't each addition take time $O(n)$?

Simplicial maps between simplicial 2-manifolds

What do log-equivalent and log-complete mean?

Trending Questions

Popular # Hahtags

Popular Questions