Blog

Problem Detail: Consider a four stage pipeline, and each stage has delays D1, D2, D3 and D4, so the total delay because of the various stages should be N * (D1 + D2 + D3 + D4) where N is the Read More …

Problem Detail: For every computable function $f$ does there exist a problem that can be solved at best in $Theta(f(n))$ time or is there a computable function $f$ such that every problem that can be solved in $O(f(n))$ can also be Read More …

Problem Detail: In famous Structure and Interretation of Computer Programs, there is an exercise (1.14), that asks for the time complexity of the following algorithm – in Scheme – for counting change (the problem statement suggests drawing the tree for (cc Read More …

Problem Detail: I have $ntimes k$ matrix with $k<n$ and I would like to find all its $nchoose k$ submatrices which are $ktimes k$ matrices that are the concatenations of all possible $k$ rows. Actually I tried to do it with Read More …

Problem Detail: A forest is a collection of trees. Is there a similar notion for paths? e.g., a _______ is a collection of paths. Asked By : Austin Buchanan Answered By : David Richerby Wikipedia says that a graph all of whose non-trivial Read More …

Problem Detail: Note: This is a part of a homework question Were asked to construct a multi-tape Turing Machine for language {$a^n b^n c^n mid n geq 0$} Then it says “Discuss how much time your machines saves over a one-tape Read More …

Problem Detail: In mathematics , an $n$-ary relation is subset of cross product on $n$ sets took under consideration. Let us take $A_1,A_2,A_3 cdots A_n$ be the n sets. Then relation $R subseteq A_1times A_2times A_3 times A_n$ . Here $X$ Read More …

Problem Detail: I’m currently dealing with a problem for which I could show that an exact algorithm would imply a general algorithm for finding the real (but not complex) roots of an arbitrary univariate polynomial with real coefficients. Now, what exactly Read More …

Problem Detail: I can see how adding 2 unsigned four-bit values is $O(n)$. We just go from the rightmost digits to the leftmost digits and add the digits up sequentially. We can also perform multiplication in polynomial time ($O(n^2)$) via the Read More …

Problem Detail: At the Wikipedia article on time complexity, only a PRAM example is given for polylogarithmic time. Let $T(n)$ denote the largest number of steps used by a machine to reach a final state on any input with size $n$ Read More …