Blog

Problem Detail: In all computer architecture books we study that Cache memory could be divided into 3 levels (L1,L2 and L3) and its very beneficial to do so. Why don’t we use the same approach in case of main memory (RAM). Read More …

Problem Detail: I want to know what is algorithm and time complexity of Hanoi tower with forbidden direct move from source to destination (it means you cannot move disk from source to destination directly and you instead of that should first Read More …

Problem Detail: A homework problem in my current CS class asks us to produce a comparison-based procedure for taking (essentially—there are some poorly-specified rules about duplicates) the set intersection of $k$ unsorted arrays of at most $n$ elements each. For full Read More …

Problem Detail: Prove that $L_1$ is regular if $L_2$, $L_1L_2$, $L_2L_1$ are regular. These are the things that I would use to start. As $L_1L_2$ is regular, then the homomorphism $h(L_1L_2)$ is regular. Let $h(L_1) = L_2$ and $h(L_2) = L_1$, Read More …

Problem Detail: I read that testing the length of the input string is in DLOGTIME. The question is how can testing the length of the input string be in DLOGTIME? $text{DLOGTIME} = O(log n)$, so what number would be in $n$? Read More …

Problem Detail: Perhaps a way to better understand the Halting Problem’s importance is to know what would happen or what could be possible if this was solved. What would be the Halting Problem’s implications in today’s technology, mathematics and its practical Read More …

Problem Detail: I have the following question to answer in a MapReduce assignment sheet The Naive Bayes classifier is a widely-used tool for analyzing data. Consider a data set that has $n$ data items, each of which has the same $m+1$ Read More …

Problem Detail: My problem is due to the fact that I am manipulating a set of amounts that span over some intervals of time (start date/end date) and that are rounded to cents. I have to multiply each of them by Read More …

Problem Detail: I read a theorem which states that: If there exists a polynomial time approximation algorithm for solving the Maximum Clique problem (or the Maximum Independent Set problem) for any constant performance ratio r, then NP = P. But I Read More …

Problem Detail: My approach Let L ∈ P $exists$ Turing Machine $M_1$ which decides L. We can easily construct $M_2$ which decides $bar{L}$ $bar{L}$ ∈ CO-NP $implies$ P ⊆ Co-NP I’m not sure whether its a correct way to prove this Read More …