List questions from computational-complexity

Published on 08 Apr 2026 - 12:12

158

Views

Recurrence relation with non-constant coefficients and modular arithmetic

Published on 12 Apr 2026 - 9:10

37

Views

computation of total complexity of an algorithm

Published on 12 Apr 2026 - 6:16

645

Views

Optimal Transport Map for Gaussian

Published on 12 Apr 2026 - 17:26

41

Views

To prove or disprove mathematically $n \log_{3}{n^2} \in \Theta(n(\log_3 n)^2) $

Published on 27 May 2021 - 9:23

37

Views

To show that $a^n \in O(n!)$

Published on 27 May 2021 - 12:53

322

Views

Can there be a problem for which we can prove there's a polynomial time algorithm and can prove that can't prove an algorithm is such?

Published on 30 May 2021 - 20:36

78

Views

Alphabetical complexity of algorithms.

Published on 03 Apr 2026 - 14:04

193

Views

Complexity of finding the cheapest path with length constraint

Published on 11 Apr 2026 - 19:41

58

Views

Is there a combinatorial structure easy to count while difficult to sample?

Published on 09 Apr 2026 - 11:59

73

Views

Build non-decreasing $f$,$g$ from $\Bbb N$ to $\Bbb N$ such that $f$ is not $O(g)$ and $g$ is not $O(f)$

Published on 31 Mar 2026 - 14:28

134

Views

Are primitive recursive functions computable in logarithmic space?

Published on 12 Apr 2026 - 12:38

119

Views

categorical logic and computation

Published on 05 Apr 2026 - 18:47

23

Views

Quantifying the complexity of the structure of a statistical model (or arbitrary program?)

Published on 12 Apr 2026 - 17:56

207

Views

What would be the implications of NP=Co-NP?

Published on 30 Mar 2026 - 0:53

List Question

Problem of finding shortest proof - some questions?

Recurrence relation with non-constant coefficients and modular arithmetic

computation of total complexity of an algorithm

Optimal Transport Map for Gaussian

To prove or disprove mathematically $n \log_{3}{n^2} \in \Theta(n(\log_3 n)^2) $

To show that $a^n \in O(n!)$

Can there be a problem for which we can prove there's a polynomial time algorithm and can prove that can't prove an algorithm is such?

Alphabetical complexity of algorithms.

Complexity of finding the cheapest path with length constraint

Is there a combinatorial structure easy to count while difficult to sample?

Build non-decreasing $f$,$g$ from $\Bbb N$ to $\Bbb N$ such that $f$ is not $O(g)$ and $g$ is not $O(f)$

Are primitive recursive functions computable in logarithmic space?

categorical logic and computation

Quantifying the complexity of the structure of a statistical model (or arbitrary program?)

What would be the implications of NP=Co-NP?

Trending Questions

Popular # Hahtags

Popular Questions