Author: ignougroup

Problem Detail: I have been reading about Big O notation. People writing about Big O often use the terms $f(x)$ and $g(x)$. For instance, I often see people write things like $f(x) = O(g(x))$ or $f(x) in O(g(x))$. Obviously $f(x)$ is Read More …

Problem Detail: Borůvka’s algorithm is one of the standard algorithms for calculating the minimum spanning tree for a graph $G = (V,E)$, with $|V| = n, |E| = m$. The pseudo-code is: MST T = empty tree Begin with each vertex Read More …

Problem Detail: I have asked this exact question on StackOverflow. I did not get the answer that I was looking for. Please read this question fully before answering. Thank You. For static pattern database(5-5-5), see this(page 290 and 283) OR there Read More …

Problem Detail: Let us say for instance I am doing string processing that requires some analysis of two strings. I have no given information about what their lengths might end up being, so they come from two distinct families. Would it Read More …

Problem Detail: I understand that soundness implies consistency. Also, I understand that consistency alone does not imply soundness. But shouldn’t consistency + completeness imply soundness? Scott Aaronson in his blog-post hints otherwise. What am I exactly missing? Update: By completeness I Read More …

Problem Detail: Let G be a directed graph with non-negative weights. We call a path between two vertices an “odd path” if its weight is odd. We are looking for an algorithm for finding the weight of the shortest odd path Read More …

Problem Detail: I’m thinking about the optimal algorithm for the following problem: Input data: a text, say it’s an article about 5-50 pages. a set of ngrams (ngram strings, n>2), of arbitrary length, could be more than 20k n-grams. The algorithm Read More …

Problem Detail: When we implement dynamic array via repeated doubling (if the current array is full) we simply create a new array that is double the current array size and copy the previous elements and then add the new one? Correct? Read More …

Problem Detail: I have read of an algorithm that a non-deterministic Turing machine $N$ can run to determine whether a given graph $G$ has a Hamiltonian path from the start node $s$ to a certain node $n$: Write a list of Read More …