List questions from computational-complexity

Published on 13 Apr 2026 - 5:02

42

Views

Efficient computation of $A^\top (AA^\top)^{-1} A v$

Published on 13 Apr 2026 - 2:07

382

Views

How can we compute the symbolic determinant and permanent in SymPy?

Published on 25 Mar 2026 - 11:24

216

Views

Proving lower bound for fibonacci sequence

Published on 14 Apr 2026 - 22:02

503

Views

Using $1+x\leq e^x$ to show that $(n+o(n))^k=\Theta(n^k)$ (CLRS)

Published on 15 Apr 2026 - 2:56

82

Views

Finding independent set in a cubic graph

Published on 15 Apr 2026 - 22:40

199

Views

Does a cubic graph polynomial contain the $x_1 x_2 \cdots x_M$ term?

Published on 16 Apr 2026 - 23:19

381

Views

Maximum common edge subgraph of two trees in polynomial time?

Published on 11 Apr 2026 - 20:54

337

Views

Time complexity of inner product of two vectors of polynomials

Published on 15 Apr 2026 - 8:46

156

Views

Computational complexity and commuting functions

Published on 12 Apr 2026 - 5:49

26

Views

Complexity of algorithms on graphs - Text request

Published on 15 Apr 2026 - 15:59

105

Views

Complexity of computing the homology of a finite topological space

Published on 14 Apr 2026 - 11:16

23

Views

Efficient way to verify if pair of numbers are medians of partition of sets

Published on 13 Apr 2026 - 19:01

53

Views

Kolmogorov $\epsilon$-entropy, $n$-width, and $\epsilon$-capacity and applications

Published on 12 Apr 2026 - 5:42

66

Views

Determining if polynomial function despite no addition/subtraction or rasing to power

Published on 11 Apr 2026 - 2:27

List Question

Are there any known NP-hard group theoretic problems?

Efficient computation of $A^\top (AA^\top)^{-1} A v$

How can we compute the symbolic determinant and permanent in SymPy?

Proving lower bound for fibonacci sequence

Using $1+x\leq e^x$ to show that $(n+o(n))^k=\Theta(n^k)$ (CLRS)

Finding independent set in a cubic graph

Does a cubic graph polynomial contain the $x_1 x_2 \cdots x_M$ term?

Maximum common edge subgraph of two trees in polynomial time?

Time complexity of inner product of two vectors of polynomials

Computational complexity and commuting functions

Complexity of algorithms on graphs - Text request

Complexity of computing the homology of a finite topological space

Efficient way to verify if pair of numbers are medians of partition of sets

Kolmogorov $\epsilon$-entropy, $n$-width, and $\epsilon$-capacity and applications

Determining if polynomial function despite no addition/subtraction or rasing to power

Trending Questions

Popular # Hahtags

Popular Questions