List questions from computational-complexity

Published on 01 Jul 2017 - 9:11

527

Views

Computational complexity: what is the worst case of the following algorithm?

Published on 05 Jul 2017 - 11:54

84

Views

Set cover problem with constant 2

Published on 05 Jul 2017 - 12:22

118

Views

Computation of Matrix inversion

Published on 07 Jul 2017 - 17:42

332

Views

Modified Divisor Summatory Function

Published on 08 Jul 2017 - 0:51

53

Views

realizing pure simplicial complexes in $3$-space

Published on 27 Mar 2026 - 13:20

128

Views

Minimal static memory allocation for a schedule

Published on 27 Mar 2026 - 23:12

7k

Views

Convert binary number into unary in O(n)

Published on 29 Mar 2026 - 3:21

1.4k

Views

Longest diagonal of a polygon

Published on 29 Mar 2026 - 20:29

103

Views

The fastest algorithm to calculate the $C^n$

Published on 26 Mar 2026 - 19:37

83

Views

Proving $6n^5 - 4n^3 + 2n \not\in \mathcal{O}(5n^4 - 3n^3 + 1)$

Published on 15 Jul 2017 - 20:18

82

Views

Prove that $\sqrt{x}( 38 x^5 + 9 ) \in O ( x^{11/2} )$

Published on 17 Jul 2017 - 2:22

166

Views

Is there an order-preserving bijection of reals with complexity classes?

Published on 17 Jul 2017 - 9:08

35

Views

Show that if $f(2n) \le Cf(n)$ for large enough $n$, where $f:N \to N$. Then $f(n)$ is asymtotically bounded by a polynomial?

Published on 19 Jul 2017 - 20:23

160

Views

Please help solve the time complexity of recurrence

Published on 06 Apr 2026 - 7:35

List Question

Computational complexity of arithmetic in the finite field $\mathbb{F}_{2^k}$

Computational complexity: what is the worst case of the following algorithm?

Set cover problem with constant 2

Computation of Matrix inversion

Modified Divisor Summatory Function

realizing pure simplicial complexes in $3$-space

Minimal static memory allocation for a schedule

Convert binary number into unary in O(n)

Longest diagonal of a polygon

The fastest algorithm to calculate the $C^n$

Proving $6n^5 - 4n^3 + 2n \not\in \mathcal{O}(5n^4 - 3n^3 + 1)$

Prove that $\sqrt{x}( 38 x^5 + 9 ) \in O ( x^{11/2} )$

Is there an order-preserving bijection of reals with complexity classes?

Show that if $f(2n) \le Cf(n)$ for large enough $n$, where $f:N \to N$. Then $f(n)$ is asymtotically bounded by a polynomial?

Please help solve the time complexity of recurrence

Trending Questions

Popular # Hahtags

Popular Questions