Question

Looking for higher-degree polynomials that might be solvable in radicals

score 158 · Answer 1 · 2026-03-27 01:45:04

158

Views

Looking for higher-degree polynomials that might be solvable in radicals

Published on 27 Mar 2026 - 1:45

score 317 · Answer 2 · 2026-03-27 00:56:24

317

Views

Recursively enumerable set is an image of primitive recursive function

Published on 27 Mar 2026 - 0:56

score 144 · Answer 3 · 2026-03-26 17:35:08

144

Views

Given two randomly ordered integer arrays A and B each of n integer numbers. Consider the following function:

Published on 26 Mar 2026 - 17:35

score 684 · Answer 4 · 2019-09-24 23:42:14

684

Views

Variants of travelling salesman problem: must visit each ``type'' of city for at least once.

Published on 24 Sep 2019 - 23:42

score 34 · Answer 5 · 2026-03-28 07:05:04

34

Views

Comparing $\mathcal{O}$ and $\Omega$

Published on 28 Mar 2026 - 7:05

score 60 · Answer 6 · 2026-03-25 12:47:38

60

Views

Directed Cyclic Graph Probability Model?

Published on 25 Mar 2026 - 12:47

score 67 · Answer 7 · 2019-09-26 11:32:45

67

Views

Can checking additional congruencies be done for the strong version of Lucas test?

Published on 26 Sep 2019 - 11:32

score 172 · Answer 8 · 2026-03-25 09:28:49

172

Views

Show that there is a flow network with a bottleneck of 1 where the mac flow is greater than 1.

Published on 25 Mar 2026 - 9:28

score 151 · Answer 9 · 2026-03-25 14:27:17

151

Views

Understanding a particular algorithm that computes $\sum\limits_{i=1}^n\lfloor\frac ni\rfloor$ with complexity less than $O(n)$

Published on 25 Mar 2026 - 14:27

score 36 · Answer 10 · 2026-03-27 12:02:02

36

Views

Algorithm for reducing sequence into smaller sequence (for specific fn)

Published on 27 Mar 2026 - 12:02

score 126 · Answer 11 · 2019-09-27 19:32:25

126

Views

Solving square root recurrences

Published on 27 Sep 2019 - 19:32

score 300 · Answer 12 · 2019-09-27 20:26:28

300

Views

Solving recurrence with the Master Theorem

Published on 27 Sep 2019 - 20:26

score 59 · Answer 13 · 2026-03-28 07:00:14

59

Views

Solving the recurrence relation $T(n) = T(n/2) + 2\log_2n + 1; T(1) = 1$

Published on 28 Mar 2026 - 7:00

score 461 · Answer 14 · 2026-03-30 07:12:39

461

Views

Use induction to prove Karatsuba algorithm (Integer Multiplication)

Published on 30 Mar 2026 - 7:12

score 391 · Answer 15 · 2019-09-30 04:43:37

391

Views

Does this property characterize minimum spanning trees?

Published on 30 Sep 2019 - 4:43

List Question

Looking for higher-degree polynomials that might be solvable in radicals

Recursively enumerable set is an image of primitive recursive function

Given two randomly ordered integer arrays A and B each of n integer numbers. Consider the following function:

Variants of travelling salesman problem: must visit each ``type'' of city for at least once.

Comparing $\mathcal{O}$ and $\Omega$

Directed Cyclic Graph Probability Model?

Can checking additional congruencies be done for the strong version of Lucas test?

Show that there is a flow network with a bottleneck of 1 where the mac flow is greater than 1.

Understanding a particular algorithm that computes $\sum\limits_{i=1}^n\lfloor\frac ni\rfloor$ with complexity less than $O(n)$

Algorithm for reducing sequence into smaller sequence (for specific fn)

Solving square root recurrences

Solving recurrence with the Master Theorem

Solving the recurrence relation $T(n) = T(n/2) + 2\log_2n + 1; T(1) = 1$

Use induction to prove Karatsuba algorithm (Integer Multiplication)

Does this property characterize minimum spanning trees?

Trending Questions

Popular # Hahtags

Popular Questions