List questions from computational-complexity

Published on 08 Nov 2013 - 1:12

184

Views

prove\disprove - there are functions $f(n)$ and $g(n)$ such that $g(n) = o(1)$ and $f(n-g(n)) \neq \Theta((f(n))$

Published on 08 Nov 2013 - 2:01

106

Views

Prove that $6^{\sqrt n} = O({n \choose n/2})$

Published on 08 Nov 2013 - 2:22

562

Views

Computational complexity of Newtons Method

Published on 08 Nov 2013 - 4:08

435

Views

find $O$ and $\Omega$ bounds as tight as possible for $T(n)=n+T(\frac n 2)+T(\frac n 4)+T(\frac n 8)+...+T(\frac n {2^k})$

Published on 30 Mar 2026 - 7:27

243

Views

Amortized analysis and the potential method

Published on 10 Nov 2013 - 23:56

78

Views

Showing particular language is NP-complete

Published on 02 Apr 2026 - 15:33

189

Views

How do I grade the complexity of the below math puzzle game?

Published on 26 Mar 2026 - 17:31

90

Views

Compute all the directional derivatives of a trivariate polynomial function quickly

Published on 13 Nov 2013 - 18:53

2.7k

Views

Convert Circuit SAT to 3-SAT

Published on 27 Mar 2026 - 2:50

131

Views

Time complexity comparison

Published on 16 Nov 2013 - 23:33

91

Views

The history function preserves recursiveness

Published on 02 Apr 2026 - 17:38

518

Views

Weighted Union Find

Published on 18 Nov 2013 - 4:56

9.9k

Views

Complexity of the algorithms for Singular Value Decomposition

Published on 30 Mar 2026 - 13:35

81

Views

Do this algorithm terminates?

Published on 20 Nov 2013 - 7:45

List Question

Upper and Lower Bounds

prove\disprove - there are functions $f(n)$ and $g(n)$ such that $g(n) = o(1)$ and $f(n-g(n)) \neq \Theta((f(n))$

Prove that $6^{\sqrt n} = O({n \choose n/2})$

Computational complexity of Newtons Method

find $O$ and $\Omega$ bounds as tight as possible for $T(n)=n+T(\frac n 2)+T(\frac n 4)+T(\frac n 8)+...+T(\frac n {2^k})$

Amortized analysis and the potential method

Showing particular language is NP-complete

How do I grade the complexity of the below math puzzle game?

Compute all the directional derivatives of a trivariate polynomial function quickly

Convert Circuit SAT to 3-SAT

Time complexity comparison

The history function preserves recursiveness

Weighted Union Find

Complexity of the algorithms for Singular Value Decomposition

Do this algorithm terminates?

Trending Questions

Popular # Hahtags

Popular Questions