Problem Detail: Suppose we’re receiving numbers in a stream. After each number is received, a weighted sum of the last $N$ numbers needs to be calculated, where the weights are always the same, but arbitrary. How efficiently can this done if Read More …
Category: Uncategorized
[Solved]: Delivery Algorithm – Find shortest paths
Problem Detail: Given – A center(lat=x,lng=y) ‘C’ from which a delivery boy makes a round trip. A delivery boy has a bag which may contain at the most 10 boxes to deliver. A set of points Di (lat=xi,lng=yi) around ‘C’ where Read More …
[Solved]: On the language of Turing machines not accepting their own encoding
Problem Detail: Let $text{NOT-SELF} = {langle M rangle : M text{ is a TM that does not accept } langle M rangle }$. How do you prove the following claim? If $Q$ is a TM so that $L(Q) subseteq text{NOT-SELF}$, prove Read More …
[Solved]: Theory of computation introductory curriculum
Problem Detail: I want to study theory of computation on my own, so I am looking for books. What set of books would you recommend for the equivalent of a one-semester course that introduces theory of computation? Please post answers that Read More …
[Solved]: Bipartite Graph Game
Problem Detail: So say we have a bipartite graph G=(X,Y,E). Let’s make a game out of it. I go first. I pick a node in X. You go next. You pick a node in Y that is connected by an edge Read More …
[Solved]: Maximize distance between k nodes in a graph
Problem Detail: I have an undirected unweighted graph $G$ and I want to select $k$ nodes from $G$ such that they are pairwise as far as possible from each other, in terms of geodesic distance. In other words they have to Read More …
[Solved]: What does it mean to say that a language is “effectively closed” under an operation?
Problem Detail: I’ve been reading some formal language theory papers, and I’ve come across a term that I don’t understand. The paper will often refer to a set being “effectively closed under intersection” or other operations. What does “effectively” mean here? Read More …
[Solved]: Finding Kernel in DAG
Problem Detail: Let $G=(V,E)$ be a DAG. A subset $A subseteq V$ is called a kernel if for all $u,v in A$ $uv notin E$ and for all $v in V-A$ there exists an $a in A$ such that $av in Read More …
[Solved]: Combinational Logic Circuits and Theory of Computation
Problem Detail: I’m trying to link Combinational Logic Circuits ( computers based on logical gates only ) with everything I have learned recently in Theory of Computation. I was wondering whether combinational logic circuits can implement computations in the same way Read More …
[Solved]: Computational complexity of the clique problem
Problem Detail: What is the best known approximation for the computational complexity of the clique problem? Is it accurate to consider it $O(2^n)$? Asked By : loveToCode Answered By : AJed Wikipedia is usually a good starting reference to well-known problems as the Read More …
