Question

faster than O(n^4) algorithm for solving the following problem

score 446 · Answer 1 · 2018-12-11 06:00:18

446

Views

faster than O(n^4) algorithm for solving the following problem

Published on 11 Dec 2018 - 6:00

score 62 · Answer 2 · 2026-03-25 11:13:45

62

Views

Runtime of computing the coefficient of a product of multinomials?

Published on 25 Mar 2026 - 11:13

score 256 · Answer 3 · 2018-12-16 20:06:36

256

Views

Prove that $O(3^{2n}) \subseteq O(2^{3n})$

Published on 16 Dec 2018 - 20:06

score 48 · Answer 4 · 2018-12-18 08:59:31

48

Views

Concluding about $f$ as a function $\mathbb{N}\to \mathbb{N}$ and finding complexity of a program

Published on 18 Dec 2018 - 8:59

score 581 · Answer 5 · 2026-03-25 08:10:03

581

Views

Is it possible to know if a number exists within one of these sequences?

Published on 25 Mar 2026 - 8:10

score 1.5k · Answer 6 · 2026-03-25 09:23:56

1.5k

Views

Minimum transactions to settle debts among friends

Published on 25 Mar 2026 - 9:23

score 49 · Answer 7 · 2018-12-20 09:22:11

49

Views

Maximum cover with $k$ element

Published on 20 Dec 2018 - 9:22

score 53 · Answer 8 · 2018-12-26 09:50:28

53

Views

Computational complexity sum of digits square root

Published on 26 Dec 2018 - 9:50

score 100 · Answer 9 · 2018-12-27 23:50:45

100

Views

Efficient way to count the number of ways to select 3 numbers from a given list has their AND(bit-wise) equal 0

Published on 27 Dec 2018 - 23:50

score 379 · Answer 10 · 2018-12-28 06:27:41

379

Views

Is there an algorithm to find the lengths of all paths from a given vertice that can run in polynomial time?

Published on 28 Dec 2018 - 6:27

score 34 · Answer 11 · 2026-03-26 01:27:31

34

Views

Doubt regarding the variable by which time complexity is measured

Published on 26 Mar 2026 - 1:27

score 27 · Answer 12 · 2018-12-30 13:51:57

Clarification on the computational complexity of $f = x + \frac{c - \left| a^* x \right|}{\left| a^* x \right|} a \left( a^* x \right)$?

score 286 · Answer 13 · 2026-03-26 17:32:34

286

Views

Using recursion tree to find time complexity of $T(n)=T(n/7)+T(3n/4)+cn$, where $c$ is a constant

Published on 26 Mar 2026 - 17:32

score 38 · Answer 14 · 2019-01-03 23:01:03

38

Views

Find a number in unsorted array larger than the median number with complexity better than O(1/2n+1)

Published on 03 Jan 2019 - 23:01

score 119 · Answer 15 · 2019-01-06 02:40:30

119

Views

Odds of drawing each card from partially known subset of cards

Published on 06 Jan 2019 - 2:40

List Question

faster than O(n^4) algorithm for solving the following problem

Runtime of computing the coefficient of a product of multinomials?

Prove that $O(3^{2n}) \subseteq O(2^{3n})$

Concluding about $f$ as a function $\mathbb{N}\to \mathbb{N}$ and finding complexity of a program

Is it possible to know if a number exists within one of these sequences?

Minimum transactions to settle debts among friends

Maximum cover with $k$ element

Computational complexity sum of digits square root

Efficient way to count the number of ways to select 3 numbers from a given list has their AND(bit-wise) equal 0

Is there an algorithm to find the lengths of all paths from a given vertice that can run in polynomial time?

Doubt regarding the variable by which time complexity is measured

Clarification on the computational complexity of $f = x + \frac{c - \left| a^* x \right|}{\left| a^* x \right|} a \left( a^* x \right)$?

Using recursion tree to find time complexity of $T(n)=T(n/7)+T(3n/4)+cn$, where $c$ is a constant

Find a number in unsorted array larger than the median number with complexity better than O(1/2n+1)

Odds of drawing each card from partially known subset of cards

Trending Questions

Popular # Hahtags

Popular Questions