Question

How can I properly force this "object" to follow the indicated path

score 37 · Answer 1 · 2026-03-29 10:47:44

37

Views

How can I properly force this "object" to follow the indicated path

Published on 29 Mar 2026 - 10:47

score 77 · Answer 2 · 2026-03-25 16:01:34

77

Views

Find polygon that traverses all given points with minimal circumference but has a single surface

Published on 25 Mar 2026 - 16:01

score 75 · Answer 3 · 2019-05-19 18:41:26

75

Views

Test if a function is continuous or has at least one discontinuous vertical asymptote between an interval

Published on 19 May 2019 - 18:41

score 66 · Answer 4 · 2019-05-19 18:52:04

66

Views

Consider a binary operation $\circ:\{1,2,\ldots,n\}\times\{1,2,\ldots, n\} \rightarrow \{1,2,\ldots, n\}$.

Published on 19 May 2019 - 18:52

score 59 · Answer 5 · 2026-03-26 12:32:22

59

Views

Choosing vectors for projection

Published on 26 Mar 2026 - 12:32

score 836 · Answer 6 · 2026-03-25 11:00:44

836

Views

A standard way to reduce a k-SAT to 0-1 Integer Linear Programming

Published on 25 Mar 2026 - 11:00

score 27 · Answer 7 · 2026-03-26 16:03:35

27

Views

Path between nodes in a colored oriented tree with given weight sum

Published on 26 Mar 2026 - 16:03

score 86 · Answer 8 · 2026-04-01 05:09:43

86

Views

Solving recurrences with Master theorem

Published on 01 Apr 2026 - 5:09

score 40 · Answer 9 · 2026-02-23 02:36:58

40

Views

Tough test polynomials for (finite precision) complex root finding methods, especially Aberth's method

Published on 23 Feb 2026 - 2:36

score 94 · Answer 10 · 2026-03-25 12:16:18

94

Views

Efficient method to check whether the nearest prime has distance $d$ or more?

Published on 25 Mar 2026 - 12:16

score 1.1k · Answer 11 · 2026-04-01 06:31:55

1.1k

Views

algorithms - When not to assume $n$ is a power of 2, while solving recurrences?

Published on 01 Apr 2026 - 6:31

score 49 · Answer 12 · 2026-03-27 20:31:42

49

Views

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

Published on 27 Mar 2026 - 20:31

score 52 · Answer 13 · 2026-03-27 05:35:30

52

Views

Play Cards Game Tournament Algorithm

Published on 27 Mar 2026 - 5:35

score 95 · Answer 14 · 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 81 · Answer 15 · 2026-03-31 09:24:06

81

Views

Prove $(log {(n)})^k = O(n)$ by definition, not by limit

Published on 31 Mar 2026 - 9:24

List Question

How can I properly force this "object" to follow the indicated path

Find polygon that traverses all given points with minimal circumference but has a single surface

Test if a function is continuous or has at least one discontinuous vertical asymptote between an interval

Consider a binary operation $\circ:\{1,2,\ldots,n\}\times\{1,2,\ldots, n\} \rightarrow \{1,2,\ldots, n\}$.

Choosing vectors for projection

A standard way to reduce a k-SAT to 0-1 Integer Linear Programming

Path between nodes in a colored oriented tree with given weight sum

Solving recurrences with Master theorem

Tough test polynomials for (finite precision) complex root finding methods, especially Aberth's method

Efficient method to check whether the nearest prime has distance $d$ or more?

algorithms - When not to assume $n$ is a power of 2, while solving recurrences?

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

Play Cards Game Tournament Algorithm

A polynomial algorithm to determine whether a finite group is nilpotent

Prove $(log {(n)})^k = O(n)$ by definition, not by limit

Trending Questions

Popular # Hahtags

Popular Questions