Category: Uncategorized

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 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 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: 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 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: 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’m trying to implement a brute-force algorithm. If I have one variable x, I can iterate through all its values using a for loop: for x in {1,2,..,MAX}: do something with x But what if I have an array Read More …

Problem Detail: Came across the following tile problem : Given a “2 x n” board and tiles of size “2 x 1″, count the number of ways to tile the given board using the 2 x 1 tiles. A tile can Read More …

Problem Detail: A parallel implementation of a computation is usually compared to a sequential version of the same computation. The ratio of the time taken by the sequential version to the time taken by the parallel version is called the speedup. Read More …

Problem Detail: Define the Nerode equivalence over a language $L subseteq Sigma^{*}$ as $u sim_L v$ iff $uw in L Leftrightarrow vw in L$ for every $w in Sigma^{*}$. The Nerode equivalence ${sim}_L$ has finitely many equivalence classes precisely when $L$ Read More …