List questions from computational-complexity

Published on 17 Mar 2026 - 16:16

93

Views

Does calculating the determinant of an $n\times n$ matrix really take $n!$ computations?

Published on 14 Feb 2018 - 20:28

54

Views

Finding subsequences $\mathbf{c}$ of $\mathbf{b}$ such that $\mathbf{a}\cdot\mathbf{c} \equiv 0\bmod t$ for fixed sequences $\mathbb{a},\mathbb{b}$

Published on 15 Feb 2018 - 6:54

1.1k

Views

Why is $3^n = O(2^n)$ false but $2^n = O(3^n)$ true?

Published on 25 Mar 2026 - 6:03

100

Views

Decidability/Semidecidability and P,NP... Computational Complexity

Published on 19 Feb 2018 - 11:11

37

Views

Complexity Theory -- NP- hard that are not NP

Published on 22 Mar 2026 - 14:43

64

Views

$\frac{n!}{\frac{n}{2}!(n-\frac{n}{2})!} \in O(n^{34})$?

Published on 20 Feb 2018 - 22:21

54

Views

To find an element in center

Published on 21 Mar 2026 - 23:38

163

Views

Time complexity for this algorithm?

Published on 22 Mar 2026 - 3:35

99

Views

A difficulty in understanding the operation of a Turing machine on a certain language.

Published on 25 Mar 2026 - 4:39

575

Views

AKS Primality Test not a polynomial time algorithm?

Published on 22 Mar 2026 - 15:29

126

Views

Categories with at most one arrow between any pair of objects. (appears in NPC)

Published on 22 Mar 2026 - 19:06

200

Views

A difficulty in understanding The implementation level description of a multi tape TM.

Published on 25 Mar 2026 - 6:02

1k

Views

Every non deterministic TM has an equivalent deterministic TM.

Published on 25 Mar 2026 - 4:35

1k

Views

Can some proof that $\det(A) \ne 0$ be checked faster than matrix multiplication?

Published on 25 Feb 2018 - 22:06

List Question

Can we efficiently determine the function $f(n,s)$?

Does calculating the determinant of an $n\times n$ matrix really take $n!$ computations?

Finding subsequences $\mathbf{c}$ of $\mathbf{b}$ such that $\mathbf{a}\cdot\mathbf{c} \equiv 0\bmod t$ for fixed sequences $\mathbb{a},\mathbb{b}$

Why is $3^n = O(2^n)$ false but $2^n = O(3^n)$ true?

Decidability/Semidecidability and P,NP... Computational Complexity

Complexity Theory -- NP- hard that are not NP

$\frac{n!}{\frac{n}{2}!(n-\frac{n}{2})!} \in O(n^{34})$?

To find an element in center

Time complexity for this algorithm?

A difficulty in understanding the operation of a Turing machine on a certain language.

AKS Primality Test not a polynomial time algorithm?

Categories with at most one arrow between any pair of objects. (appears in NPC)

A difficulty in understanding The implementation level description of a multi tape TM.

Every non deterministic TM has an equivalent deterministic TM.

Can some proof that $\det(A) \ne 0$ be checked faster than matrix multiplication?

Trending Questions

Popular # Hahtags

Popular Questions