Question

What is the lowest computational complexity of multiplying two non-square matrices?

score 317 · Answer 1 · 2019-05-22 19:58:40

317

Views

What is the lowest computational complexity of multiplying two non-square matrices?

Published on 22 May 2019 - 19:58

score 251 · Answer 2 · 2019-05-23 10:20:48

251

Views

Sum of sqrt of eigenvalues without computing all eigenvalues

Published on 23 May 2019 - 10:20

score 48 · Answer 3 · 2019-05-23 12:23:48

48

Views

Complexity of solving a linear equation system over $k[x]$

Published on 23 May 2019 - 12:23

score 95 · Answer 4 · 2026-03-25 07:40:56

95

Views

A polynomial algorithm to determine whether a finite group is nilpotent

Published on 25 Mar 2026 - 7:40

score 34 · Answer 5 · 2019-05-25 11:21:35

34

Views

exponential time complexity for $M(n,n)$ with $ M(i,j) = M(i-1,j) + M(i-1,j-1) + M(i,j-1) $.

Published on 25 May 2019 - 11:21

score 42 · Answer 6 · 2026-03-25 15:22:46

42

Views

upper bound on, or fast algorithm to find, an order $2^n$ element in the multiplicative group modulo prime $q(2^n)+1$

Published on 25 Mar 2026 - 15:22

score 27 · Answer 7 · 2026-03-25 11:01:04

27

Views

Why the dynamic solution to vertex cover does not prove anything?

Published on 25 Mar 2026 - 11:01

score 57 · Answer 8 · 2019-05-27 11:40:09

57

Views

Complexity of a specific class of definite integrals

Published on 27 May 2019 - 11:40

score 42 · Answer 9 · 2019-05-29 21:59:39

42

Views

How can I show that $O( \sqrt{n} \cdot \log_2(n) \cdot \log_2(\log_2(n))) < O(n)$?

Published on 29 May 2019 - 21:59

score 81 · Answer 10 · 2019-06-04 20:36:15

81

Views

Almost quadratic computational complexity

Published on 04 Jun 2019 - 20:36

score 60 · Answer 11 · 2019-06-05 20:56:37

60

Views

Evaluating the Sum $\sum_{r=1}^L \sum_{i=1}^L \left \lfloor \frac {L}{\left(\frac {r^2+i^2}{gcd(r,i)}\right)}\right \rfloor \cdot 2r$

Published on 05 Jun 2019 - 20:56

score 337 · Answer 12 · 2019-06-05 21:48:44

337

Views

Algorithm Complexity - For loop inside while loop; decreasing by factor 2

Published on 05 Jun 2019 - 21:48

score 75 · Answer 13 · 2019-06-07 17:54:49

75

Views

Clique of constant size

Published on 07 Jun 2019 - 17:54

score 157 · Answer 14 · 2026-03-25 12:33:53

157

Views

NP-Complete proof of deciding if a graph has another Hamiltonian Circuit

Published on 25 Mar 2026 - 12:33

score 48 · Answer 15 · 2019-06-10 12:25:58

48

Views

Series answer for larger constraints

Published on 10 Jun 2019 - 12:25

List Question

What is the lowest computational complexity of multiplying two non-square matrices?

Sum of sqrt of eigenvalues without computing all eigenvalues

Complexity of solving a linear equation system over $k[x]$

A polynomial algorithm to determine whether a finite group is nilpotent

exponential time complexity for $M(n,n)$ with $ M(i,j) = M(i-1,j) + M(i-1,j-1) + M(i,j-1) $.

upper bound on, or fast algorithm to find, an order $2^n$ element in the multiplicative group modulo prime $q(2^n)+1$

Why the dynamic solution to vertex cover does not prove anything?

Complexity of a specific class of definite integrals

How can I show that $O( \sqrt{n} \cdot \log_2(n) \cdot \log_2(\log_2(n))) < O(n)$?

Almost quadratic computational complexity

Evaluating the Sum $\sum_{r=1}^L \sum_{i=1}^L \left \lfloor \frac {L}{\left(\frac {r^2+i^2}{gcd(r,i)}\right)}\right \rfloor \cdot 2r$

Algorithm Complexity - For loop inside while loop; decreasing by factor 2

Clique of constant size

NP-Complete proof of deciding if a graph has another Hamiltonian Circuit

Series answer for larger constraints

Trending Questions

Popular # Hahtags

Popular Questions