Category: Uncategorized

Problem Detail: I am working through Sipser, and I am trying to understand some of the algorithms described in Space Complexity, but I am having a hard time understanding the presentation of the material (especially Savitch’s theorem). I have a very Read More …

Problem Detail: I am little bit confused between the two answers below. What is the exact answer of this question? My query is, “Deleted data remains on a disk until…?” The data is overwritten; The recycle bin is emptied. I have Read More …

Problem Detail: Are there any graph implementation data structures beyond the standard adjacency list/matrix ones? If so, what are they? I welcome experimental ones as well as highly specialized ones. A little background: I’m developing an algorithm that relies heavily on Read More …

Problem Detail:  You are given a tree $T=(V,E)$ along with a designated root node $r in V$.The parent of any node $v ne r$, denoted $p(v)$, is defined to be the node adjacent to $v$ in the path from $r$ Read More …

Problem Detail: I’m currently taking a class in Automata Theory and it’s kicking my butt. I have an assignment that my teacher gave me that consists of three questions. I have no idea where to start. My teacher and I have Read More …

Problem Detail: I want to know the difference between these three languages and it would be great if you would give some examples as well, thank you. 🙂 Asked By : hackhan Answered By : Yuval Filmus An alphabet $Sigma$ is a finite Read More …

Problem Detail: Let $n$ be the number of strings which are sorted in lexicographical order and stored in a balanced binary search tree. You are provided with a prefix $x$ of which $M$ strings have the prefix $x$. I have devised Read More …

Problem Detail: making exercises to prepare a test I’m having problems to understand 2 questions, the questions are: how many are the leafs of a decisional tree associated to any algorithm for the search problem in a ordered set? for this Read More …

Problem Detail: So, I remember the professor saying that SAT does not reduce to QBF (Quantifier Boolean Formula) $QBF ::= prop|-QBF|(QBFoQBF)|exists pQBF |forall pQBF$ So, I guess this is not NP, since solving a QBF could grow exponentially. However, $P subseteq Read More …

Problem Detail: I know that maximum independent set on cubic triangle-free graphs is NP-complete. Is it still NP-complete in case we require the independent set to be of size exactly $|V|/2$? Basiclly, YES instance of independent set problem on cubic triangle-free Read More …