All Questions

I am reading Probability and Computing, by Mitzenmacher and Upfal, and the exercise 1.24 asks for a generalized algorithm for finding the cut-set of a Graph.
In this generalized version, instead of ...

Prove by induction that if Quicksort with Explicit Stacking is modified so that the end-points of the larger sublist are stacked, and the other sublist is sorted first, then the maximum stack size is $...

Let some problem $P$ is in $\textbf{DSPACE}(\log^2 n)$ and $Q$ is a problem in $\textbf{DSPACE}(\log n)$. I can claim that $P$ is polynomial time solvable as number of turing machine configurations ...

We see that there is a sign, exponent, and mantissa part for the notation. But, there is no location for the significant bit.
Why isn't it necessary to store an integer part of significant in IEEE754 ...

Have a set of examples given to me, but I'm pretty sure they're all wrong. Can someone verify that my understanding of them is correct?
If set $Y$ can be solved in $O(2^n)$ and $Y \leq_p X$ then $X ...

I have been writing an algorithm to find the sum of 2 numbers. I have done some research on how algorithms can be represented. Algorithms can be represented as Flowcharts,pseudocode,structured English,...

If I Have a DCFL $L$ ( a CFL which can be recognised by a DPDA ),
How do I prove that $\overline{L}$ is also a DCFL
I checked my textbook for a proof but I wasn't able to understand the language.
Can ...

The Bellman-Ford algorithm can be used to find a negative cycle in a general graph, in time $O(|V||E|)$. Is there a faster algorithm for finding a negative cycle in a bipartite directed graph, where ...

Wikipedia lists $O(M(n))$ as the best complexity (out of the algorithms listed) for division on two $n$-digit numbers, where $M(n)$ is the complexity of the multiplication algorithm of choice. This is ...

I'm new to complexity theory and am analyzing inclusions between complexity classes. Suppose we are given the following seven complexity classes
$DTIME(n)$
$DTIME(n^2)$
$DTIME(2^n)$
$DTIME(2^{2^n})$
$...

I have already shown that 3-colorable for an unrestricted graph is in NP, but I was thinking about the similar language defined as the set of all acyclic $G$, where $G$ such that $G$ is 3-colorable. ...

Let $\Sigma = \{a, b\}$ an alphabet. Are the regular expressions $a^*a$ and $aa^*$ over $\Sigma$ equivalent? Even though concatenation is not commutative, in this case it seems like the statement is ...

I am new to the field of Image processing. I recently came across MR8 filter and it is available in this link but I could not find well written expressions for mathematical treatment of the filter. ...