Category: Uncategorized

Problem Detail: Given three strings $x$, $y$, and $z$ over an arbitrary finite alphabet, I need to determine their longest common subsequence (LCS). Example: A longest common subsequence of bandana, cabana, and magazine is aan. I’m trying to find an algorithm Read More …

Problem Detail: I have a rough idea that the time complexity is O(mn) where m and n are based on the length of signals, as per this http://en.wikipedia.org/wiki/Dynamic_time_warping. How can I determine the time complexity of the following code (source) function Read More …

Problem Detail: The paragraph on V-opt heuristic TSP algorithms at this site mentions a very effective algorithm due to Lin-Kernigham-Johnson. That page says: For many years Lin–Kernighan–Johnson had identified optimal solutions for all TSPs where an optimal solution was known and Read More …

Problem Detail: Consider the following protocol, meant to authenticate $A$ (Alice) to $B$ (Bob) and vice versa. $$ begin{align*} A to B: &quad text{“I'm Alice”}, R_A B to A: &quad E(R_A, K) A to B: &quad E(langle R_A+1, P_Arangle, K) end{align*} Read More …

Problem Detail: I was solving this question. It is as follows Joe picks an integer from the list $1,2,cdots,N$ with a probability $p_i$ of picking $i$ for all $1leq i leq N$. He then gives Jason $K$ attempts to guess his Read More …

Problem Detail:  AB 00 01 11 10 00 | x | 1 | 0 | 1 | CD 01 | 0 | 1 | x | 0 | 11 | 1 | x | x | 0 | 10 | Read More …

Problem Detail: Are there any CS problems, preferably open, that are related to music or musical theory somehow? I would think of problem with musical notation but also probabilities when randomizing according to a scale or a tonality or general what Read More …

Problem Detail: Trivially decidable problem is one in which the problem is a known property of the language/grammar. So intersection of two regular languages is regular should be trivially decidable? But it is given as not trivially decidable. Asked By : user1771809 Read More …

Problem Detail: I’m writing a JavaScript library for calculating graph measurements such as degree centrality, eccentrality, closeness and betweenness. In order to validate my library I use two exist applications Gephi and NodeXL to run calculation with them. The problem is Read More …

Problem Detail: One of my courses introduced the following question: Given the recurrence relation for mergesort: $T(n) = 2T(n/2) + n$ How would the following parameter passing strategies influence the relation and running time of the algorithm: A pointer to the Read More …