List questions from computational-complexity

Published on 19 Jan 2015 - 14:21

927

Views

Number of submatrices of sum K

Published on 21 Jan 2015 - 6:35

386

Views

Solving a summation where the inner summation is limited by the iterator of the two outer summations

Published on 21 Jan 2015 - 9:24

82

Views

Decidability of given languages

Published on 30 Mar 2026 - 21:42

40

Views

Need help figuring out $O(log$ $n)$ algorithm

Published on 26 Jan 2015 - 22:49

1.5k

Views

Big Omega problem : is $n^2\in\Omega (2n^2)$?

Published on 27 Jan 2015 - 4:37

850

Views

Using limits to prove a function is in the order of another function

Published on 28 Jan 2015 - 18:17

89

Views

Recurrence Relations Closed Form

Published on 29 Jan 2015 - 1:39

21

Views

Finding $2m+1=2\alpha k+\alpha^2$ quickly

Published on 29 Jan 2015 - 17:30

88

Views

Is there a typo in this runtime analysis of selection sort?

Published on 26 Mar 2026 - 7:58

290

Views

Fingerprinting and randomized algorithms

Published on 02 Feb 2015 - 21:49

195

Views

Is there a clever shortcut to showing that this function is in O(N^2)?

Published on 04 Feb 2015 - 0:03

267

Views

Show the correctness: $\log^3( n)\in o(n^{0.5})$

Published on 04 Feb 2015 - 5:23

679

Views

How to give a big O estimate/visualize for these while loop?

Published on 05 Feb 2015 - 1:41

224

Views

Simple factorials

Published on 30 Mar 2026 - 8:35

List Question

Book or paper recommendation about "Rube Goldberg Mathematics" // e.g. Longest path problems

Number of submatrices of sum K

Solving a summation where the inner summation is limited by the iterator of the two outer summations

Decidability of given languages

Need help figuring out $O(log$ $n)$ algorithm

Big Omega problem : is $n^2\in\Omega (2n^2)$?

Using limits to prove a function is in the order of another function

Recurrence Relations Closed Form

Finding $2m+1=2\alpha k+\alpha^2$ quickly

Is there a typo in this runtime analysis of selection sort?

Fingerprinting and randomized algorithms

Is there a clever shortcut to showing that this function is in O(N^2)?

Show the correctness: $\log^3( n)\in o(n^{0.5})$

How to give a big O estimate/visualize for these while loop?

Simple factorials

Trending Questions

Popular # Hahtags

Popular Questions