Problem Detail: Let $G$ be a graph, and let $s$ and $t$ be two vertices of $G$. Can we efficiently sample a shortest $s$-$t$ path uniformly and independently at random from the set of all shortest paths between $s$ and $t$? Read More …
Category: Uncategorized
[Solved]: Quantum computing roadmap
Problem Detail: I have to create a roadmap for the quantum computing technology. Looking around I found the timeline on wikipedia that is pretty wide but does not highlight the key events in quantum computing research neither sets the possible future Read More …
[Solved]: Bridge theorems for group theory and formal languages
Problem Detail: Is there some natural or notable way to relate or link math groups and CS formal languages or some other core CS concept e.g. Turing machines? I am looking for references/applications. However note that I am aware of Read More …
[Solved]: Meaning of the Halting problem
Problem Detail: The Halting Problem is defined as: $H_{TM} = { langle M, w rangle mid text{(M) halts on input (w)}}$ I’m not sure what it means. Is $H_{TM}$ a collection of Turing Machines such that all of them accept/reject the Read More …
[Solved]: Solve a recurrence by drawing the recursion tree?
Problem Detail: I’m studying for an entrance exam and I have sample questions. One of the questions is this Prove that recurrence $T(n) = T(n/5) + T(4n/5)+n/2$ has a solution $T(n) = omega(n log n)$. Solve by drawing the recursion tree. Read More …
[Solved]: Minimum weight triangulation
Problem Detail: I’m just curious about the pseudocode (or real source code, doesn’t matter) of the recursive version of this algorithm. In almost every book chapter/paper when describing this topic, they mention that the recursive version takes exponential time and then Read More …
[Solved]: Commonly used Error Correcting Codes
Problem Detail: We know error correcting codes are parameterized as (n,k,d) codes. I wanted to know the values of these parameters for some commonly used error correcting codes in computer memories or in DRAMs, etc. I just wanted to see some Read More …
[Solved]: Data structure to use for a consumable message queue where it’s safe for messages to overwrite one another
Problem Detail: I have a queue of messages representing filesystem operations that need to be processed in order. A message may succeed or fail when it’s sent. A change message, for example, is generated when a user creates or saves a Read More …
[Solved]: Happened-before and Causal order
Problem Detail: I’m reading Lamport’s “Time, Clocks, and the Ordering of Events in a Distributed System” and there’s a detail that’s bugging me. Lamport defines the “happened before” partial order, which I understand. Then he says that “Another way of viewing Read More …
[Solved]: Context Free Grammar for language
Problem Detail: The language is $L = {a^{i} b^{j} c^{k} ;|; k neq 2j}$. I’m trying to write a grammar for this language, what I have so far is: $S rightarrow AT_{1} ;|; AT_{2} ;|; AT_{3} ;|; AB ;|; AC$ $A Read More …