Question

Substitution method to solve recurrences.

score 243 · Answer 1 · 2026-04-10 02:11:25

243

Views

Substitution method to solve recurrences.

Published on 10 Apr 2026 - 2:11

score 93 · Answer 2 · 2026-04-13 12:10:27

93

Views

Is it possible to have two $NP$- complete languages whose union is $\{ 0, 1\}^*$?

Published on 13 Apr 2026 - 12:10

score 43 · Answer 3 · 2026-04-15 15:15:32

43

Views

time complexity and big O notation of sub set dynamic programming

Published on 15 Apr 2026 - 15:15

score 195 · Answer 4 · 2026-04-16 15:49:29

195

Views

Solving recurrence relation $T(n) = T(n - 1) + n^2$ using mathematical induction.

Published on 16 Apr 2026 - 15:49

score 118 · Answer 5 · 2026-04-15 21:17:22

118

Views

Is there any polynomial algorithm to check if an integer is of the form $x=p^r q^s$, where $p$ and $q$ are primes?

Published on 15 Apr 2026 - 21:17

score 206 · Answer 6 · 2026-04-13 05:34:40

206

Views

Matching students to courses (easy), but with course-capacities (hard).

Published on 13 Apr 2026 - 5:34

score 259 · Answer 7 · 2026-04-14 23:00:27

259

Views

Time Complexity of Modular Multiplication

Published on 14 Apr 2026 - 23:00

score 60 · Answer 8 · 2026-03-25 11:26:28

60

Views

Computational power of superluminal signaling TM

Published on 25 Mar 2026 - 11:26

score 44 · Answer 9 · 2026-04-15 07:42:10

44

Views

Complexity of SVD computation assuming knowing left singular vectors and singular values

Published on 15 Apr 2026 - 7:42

score 186 · Answer 10 · 2026-04-10 22:08:38

186

Views

Generalized Master Theorem (Divide-and-Conquer) using Ceil / Floor

Published on 10 Apr 2026 - 22:08

score 31 · Answer 11 · 2026-03-25 20:41:32

31

Views

Resources for a simple introduction to computational complexity

Published on 25 Mar 2026 - 20:41

score 40 · Answer 12 · 2026-04-14 15:55:02

40

Views

Would a polynomial time solution for an NP complete problem that relies on precomputed primes be sufficient to prove P=NP?

Published on 14 Apr 2026 - 15:55

score 127 · Answer 13 · 2026-04-13 10:18:14

127

Views

Does this imply finding the first $n$ primes has a polynomial time complexity?

Published on 13 Apr 2026 - 10:18

score 52 · Answer 14 · 2026-04-17 09:39:29

52

Views

Computational Complexity of Computing Complex Multiplication Maps on CM Elliptic Curves

Published on 17 Apr 2026 - 9:39

score 40 · Answer 15 · 2026-04-15 18:19:27

40

Views

Deciding whether a graph admits a nontrivial star-stabiliser

Published on 15 Apr 2026 - 18:19

List Question

Substitution method to solve recurrences.

Is it possible to have two $NP$- complete languages whose union is $\{ 0, 1\}^*$?

time complexity and big O notation of sub set dynamic programming

Solving recurrence relation $T(n) = T(n - 1) + n^2$ using mathematical induction.

Is there any polynomial algorithm to check if an integer is of the form $x=p^r q^s$, where $p$ and $q$ are primes?

Matching students to courses (easy), but with course-capacities (hard).

Time Complexity of Modular Multiplication

Computational power of superluminal signaling TM

Complexity of SVD computation assuming knowing left singular vectors and singular values

Generalized Master Theorem (Divide-and-Conquer) using Ceil / Floor

Resources for a simple introduction to computational complexity

Would a polynomial time solution for an NP complete problem that relies on precomputed primes be sufficient to prove P=NP?

Does this imply finding the first $n$ primes has a polynomial time complexity?

Computational Complexity of Computing Complex Multiplication Maps on CM Elliptic Curves

Deciding whether a graph admits a nontrivial star-stabiliser

Trending Questions

Popular # Hahtags

Popular Questions