Question

minimal generating set for given set of strings

score 70 · Answer 1 · 2026-04-11 03:23:43

70

Views

minimal generating set for given set of strings

Published on 11 Apr 2026 - 3:23

score 72 · Answer 2 · 2021-04-02 14:05:41

72

Views

Calculating $\sum_{k=1}^{N} k^rf_k$ less than $O(r^2)$ where f is the Fibonacci numbers

Published on 02 Apr 2021 - 14:05

score 50 · Answer 3 · 2026-04-10 01:54:22

50

Views

Algorithm time complexity

Published on 10 Apr 2026 - 1:54

score 299 · Answer 4 · 2026-04-11 17:00:25

299

Views

Efficicient algorithm to check if $az+1=(xz+1)(yz+1)$

Published on 11 Apr 2026 - 17:00

score 271 · Answer 5 · 2026-03-25 20:41:49

271

Views

Finding the Lower Bound (Ω), Upper Bound (O), and Average (Θ) of a Function f(n), given g(n)

Published on 25 Mar 2026 - 20:41

score 630 · Answer 6 · 2026-04-12 08:40:45

What is the largest number of bit operations that can be completed in one second, where each bit operation takes 10^(-9) seconds to complete?

score 824 · Answer 7 · 2021-04-13 20:27:24

824

Views

If P = NP, then the following problem would be solvable in polynomial time?

Published on 13 Apr 2021 - 20:27

score 424 · Answer 8 · 2026-03-26 08:04:08

424

Views

Speeding up bisection algorithm

Published on 26 Mar 2026 - 8:04

score 83 · Answer 9 · 2026-04-11 19:26:24

83

Views

Is there a better equation to represent the digits of pi graphically than the one shown below?

Published on 11 Apr 2026 - 19:26

score 460 · Answer 10 · 2026-04-12 02:03:53

460

Views

Can somebody please explain to me why NPSPACE=PSPACE in a simple way?

Published on 12 Apr 2026 - 2:03

score 56 · Answer 11 · 2026-04-12 00:39:04

56

Views

Efficient way of checking set inclusion for projected convex polytopes: $\pi(P_L) \subseteq \pi(P_M)$

Published on 12 Apr 2026 - 0:39

score 113 · Answer 12 · 2021-04-15 17:07:54

113

Views

Sketch a proof that stCONN is in the class NSPACE(log n) = NL .

Published on 15 Apr 2021 - 17:07

score 84 · Answer 13 · 2026-04-03 20:28:34

84

Views

Construct a bijective function to map arbitrary integer from [1, n] to [1, n] randomly

Published on 03 Apr 2026 - 20:28

score 350 · Answer 14 · 2026-03-29 21:27:19

350

Views

Is a Turing Machine That Runs in Polynomial Time, But Has an Exponential Description, Polynomial or Exponential?

Published on 29 Mar 2026 - 21:27

score 326 · Answer 15 · 2026-04-11 07:27:01

326

Views

Is Rule 30 Turing complete?

Published on 11 Apr 2026 - 7:27

List Question

minimal generating set for given set of strings

Calculating $\sum_{k=1}^{N} k^rf_k$ less than $O(r^2)$ where f is the Fibonacci numbers

Algorithm time complexity

Efficicient algorithm to check if $az+1=(xz+1)(yz+1)$

Finding the Lower Bound (Ω), Upper Bound (O), and Average (Θ) of a Function f(n), given g(n)

What is the largest number of bit operations that can be completed in one second, where each bit operation takes 10^(-9) seconds to complete?

If P = NP, then the following problem would be solvable in polynomial time?

Speeding up bisection algorithm

Is there a better equation to represent the digits of pi graphically than the one shown below?

Can somebody please explain to me why NPSPACE=PSPACE in a simple way?

Efficient way of checking set inclusion for projected convex polytopes: $\pi(P_L) \subseteq \pi(P_M)$

Sketch a proof that stCONN is in the class NSPACE(log n) = NL .

Construct a bijective function to map arbitrary integer from [1, n] to [1, n] randomly

Is a Turing Machine That Runs in Polynomial Time, But Has an Exponential Description, Polynomial or Exponential?

Is Rule 30 Turing complete?

Trending Questions

Popular # Hahtags

Popular Questions