List questions from computer-science

Published on 26 Mar 2026 - 12:42

754

Views

Proving the asymptotic relationship of functions using infinite limits

Published on 06 Oct 2016 - 23:28

2.9k

Views

True or false: If log f (n) ∈ Θ(log g(n)), then f (n) ∈ Θ(g(n)).

Published on 07 Oct 2016 - 7:12

63

Views

Trying to find a recursive solution.

Published on 31 Mar 2026 - 15:50

94

Views

Are mathematicians discovering algorithms by mining them with computers?

Published on 25 Mar 2026 - 8:12

160

Views

Looking for interdisciplinary research topics

Published on 01 Apr 2026 - 7:59

824

Views

Single state PDA for $L = \{ a^nb^n \mid n\ge 0 \}$

Published on 26 Mar 2026 - 4:32

112

Views

Regular expression equivalent to following automaton?

Published on 25 Mar 2026 - 14:19

714

Views

Connection between F-Algebras and algebras for a monad

Published on 25 Mar 2026 - 17:39

47

Views

Why do I find the same upper bound for $T_{1}(n) = 3T_{1}(\frac{n}{2}) + n$ and $T_{2}(n) = 3T_{2}(\frac{n}{2}) + \log_{2}(n)$?

Published on 27 Mar 2026 - 23:35

35

Views

Computer Science Question

Published on 11 Oct 2016 - 23:45

39

Views

Comp Science Question Divide and conquer

Published on 12 Oct 2016 - 0:49

32

Views

Asymptotic Complexity and the quantity (n - 1)

Published on 28 Mar 2026 - 1:06

1.3k

Views

Turing machine notation, need translation

Published on 26 Mar 2026 - 18:30

166

Views

What are the propositions or axioms in time complexity analysis that address the issue of practical machines versus theoretical machines?

Published on 26 Mar 2026 - 16:56

List Question

Traversing a hyperplane

Proving the asymptotic relationship of functions using infinite limits

True or false: If log f (n) ∈ Θ(log g(n)), then f (n) ∈ Θ(g(n)).

Trying to find a recursive solution.

Are mathematicians discovering algorithms by mining them with computers?

Looking for interdisciplinary research topics

Single state PDA for $L = \{ a^nb^n \mid n\ge 0 \}$

Regular expression equivalent to following automaton?

Connection between F-Algebras and algebras for a monad

Why do I find the same upper bound for $T_{1}(n) = 3T_{1}(\frac{n}{2}) + n$ and $T_{2}(n) = 3T_{2}(\frac{n}{2}) + \log_{2}(n)$?

Computer Science Question

Comp Science Question Divide and conquer

Asymptotic Complexity and the quantity (n - 1)

Turing machine notation, need translation

What are the propositions or axioms in time complexity analysis that address the issue of practical machines versus theoretical machines?

Trending Questions

Popular # Hahtags

Popular Questions