Author: ignougroup

Question Detail: 3-Coloring problem can be proved NP-Complete making use of the reduction from 3SAT Graph Coloring (from 3SAT). As a consequence, 4-Coloring problem is NP-Complete using the reduction from 3-Coloring: Reduction from 3-Coloring instance: adding an extra vertex to the Read More …

Question Detail: I’m trying to find the Maximum Independent Set of a Biparite Graph. I found the following in some notes “May 13, 1998 – University of Washington – CSE 521 – Applications of network flow”: Problem: Given a bipartite graph Read More …

Question Detail: Say you have two polynomials: $3 + x$ and $2x^2 + 2$. I’m trying to understand how FFT helps us multiply these two polynomials. However, I can’t find any worked out examples. Can someone show me how FFT algorithm Read More …

Question Detail: Per recommendation I am reposting this from Stack Overflow. Recently I have been thinking about following issue. Consider the code for a standard “Hello world!” program: main() { printf(“Hello World”); } Now almost any change in this code will Read More …

Question Detail: I’ve been reading about Lambda calculus recently but strangely I can’t find an explanation for why it is called “Lambda” or where the expression comes from. Can anyone explain the origins of the term? Asked By : Pickle Best Answer Read More …

Question Detail: I am reading a book called Principles of Computer Science (2008), by Carl Reynolds and Paul Tymann (published by Schaum’s Outlines). The second chapter introduces algorithms with an example of a sequential search which simply iterates through a list Read More …

Question Detail: In some places in the world, people don’t usually have access to (and hence little knowledge of) computers, and even if they have, hard- and software are outdated and usage plagued by power outages and such. Access to (good) Read More …

Question Detail: Here’s a question from a past exam I’m trying to solve: For an undirected graph $G$ with positive weights $w(e) geq 0$, I’m trying to find the minimum cut. I don’t know other ways of doing that besides using Read More …

Question Detail: If a graph $G$ is connected and has no path with a length greater than $k$, prove that every two paths in $G$ of length $k$ have at least one vertex in common. I think that that common vertex Read More …

Question Detail: Suppose that you’re given a fair coin and you would like to simulate the probability distribution of repeatedly flipping a fair (six-sided) die. My initial idea is that we need to choose appropriate integers $k,m$, such that $2^k = Read More …