List questions from computational-complexity

1.1k

Views

In terms of complexity, is there a quicker way of checking if a matrix is nonsingular than computing the determinant?

Published on 18 Nov 2012 - 4:59

50

Views

Number of steps to eliminate all elements from an array, reducing by a decreasing fraction

Published on 18 Nov 2012 - 13:27

83

Views

Number of solutions $x_1x_2\dots x_k = n, x_i, n \in \mathbb{N}$

Published on 19 Nov 2012 - 1:26

164

Views

Möbius function help

Published on 23 Nov 2012 - 4:35

31

Views

How to verify that $(x_1 + … + x_n)^2$ represents $MOD_3$

Published on 23 Nov 2012 - 14:26

628

Views

compute overlapping % of 2 parallel lines

Published on 27 Nov 2012 - 19:09

199

Views

Computational complexity of unknotting problem?

Published on 30 Mar 2026 - 3:34

89

Views

Proof of NP-completeness for the following

Published on 28 Mar 2026 - 5:22

1.6k

Views

Time complexity - Why does doubling the speed given this improvement?

Published on 30 Nov 2012 - 21:57

98

Views

Using the notation $m^{O(1)}$

Published on 03 Dec 2012 - 18:57

90

Views

complexity of time constructible function

Published on 07 Dec 2012 - 17:26

6.4k

Views

Algorithm to check whether a graph has no cycles

Published on 08 Dec 2012 - 12:12

1.5k

Views

Complement of NP-Complete

Published on 02 Apr 2026 - 18:25

4.8k

Views

How to prove CYK algorithm has $O(n^3)$ running time

Published on 09 Apr 2026 - 7:29

379

Views

IF a language L logspace reduces to SAT, does L

Published on 05 Apr 2026 - 0:03

List Question

In terms of complexity, is there a quicker way of checking if a matrix is nonsingular than computing the determinant?

Number of steps to eliminate all elements from an array, reducing by a decreasing fraction

Number of solutions $x_1x_2\dots x_k = n, x_i, n \in \mathbb{N}$

Möbius function help

How to verify that $(x_1 + … + x_n)^2$ represents $MOD_3$

compute overlapping % of 2 parallel lines

Computational complexity of unknotting problem?

Proof of NP-completeness for the following

Time complexity - Why does doubling the speed given this improvement?

Using the notation $m^{O(1)}$

complexity of time constructible function

Algorithm to check whether a graph has no cycles

Complement of NP-Complete

How to prove CYK algorithm has $O(n^3)$ running time

IF a language L logspace reduces to SAT, does L

Trending Questions

Popular # Hahtags

Popular Questions