Author: ignougroup

Problem Detail: I have a complete $n$-partite graph, where each partite set has $n$ vertices (yes it’s also $n$), so the graph has $n^2$ vertices in total. My problem is to find a minimum weight $n$-clique in the graph. I would Read More …

Problem Detail: Suppose I’m renaming a file and the electricity goes off right in the middle. Naively, it looks like the file could be in some “half-renamed” state. Maybe the name would have half the old name and half the new Read More …

Problem Detail: I’m reading Tracy Kidder’s “The Soul of a New Machine” where a team at Data General design a new machine (codenamed “Eagle”, later named MV/8000). It is 32-bit extension of a previous architecture (the 16-bit Eclipse). One of the Read More …

Problem Detail: I am trying to solve the following equation using master’s theorem. $T(n) = 3^n T(frac{n} 3) + O(1)$ Extracting the b and $f(n)$ values makes sense they are $b=3$ and $f(n)=1$. I am not sure what my $a$ value Read More …

Problem Detail: This question is inspired by the Bogo-Sort algorithm and the discussion of whether there are any worse sorting algorithms than Bogosort. Assume that $A$ is an array initialized by a random permutation on the set $I_n={1,2,ldots, n}$. Consider the Read More …

Problem Detail: I have read some complexity papers in which “for infinitely many input sizes” is used. What is the difference in the computational complexity context between “for infinitely many input sizes” and “for all input sizes”? Asked By : Jose Antonio Read More …

Problem Detail: Lots of basic questions are there in my mind. I need to clear them. Statement 1: A compiler converts a human-readable codes to object codes, and those are converted to a machine code (executable) by linker. Am I right Read More …

Problem Detail: Denote $D$ a set of finite sequences of integers. In Papadimitriou’s “Computational Complexity” in theorem 2.5 it is proved that if a RAM program $Pi$ computes a function $phi$ from $D$ to integers in time $f(n)$, then there is Read More …

Problem Detail: There is a network with $n$ nodes. Each node can contact only the neighbouring nodes (the degree of each node is bounded, if that matters). One of the nodes, say $s$, wants to know $n$. How can it do Read More …