Category: Uncategorized

Problem Detail: Say we have a $n times n$ table which elements are sorted column-wise, for example: $$ left( begin{array}{ccc} 2 & 4 & 1 3 & 5 & 6 7 & 9 & 8 end{array} right) $$ I would like Read More …

Problem Detail: I have tried to solve the following exercise but I got stuck while trying to find all the critical pairs. I have the following questions: How do I know which critical pair produced a new rule? How do I Read More …

Problem Detail: I thought I understood dependent typing (DT) properly, but the answer to this question: Why was there a need for Martin-Löf to create intuitionistic type theory? has had me thinking otherwise. After reading up on DT and trying to Read More …

Problem Detail: Consider an undirected weighted graph $G = (V,E)$, where $V subset mathbb{R}^3$ so the points are 3D, and the weight of an edge equals the (Euclidean) distance between its endpoints. Note that we’re not given the coordinates of the Read More …

Problem Detail: I hope I’m in the right section: I know that if P = NP, then 3-SAT can be solved in P (Cook), but is the opposite valid, too? If P != NP, then 3-SAT is not in P? Thanks! Read More …

Problem Detail: In the set cover (SC) problem we are given a universe $U$ (a set) of $n$ elements and a collection $S$ of $m$ sets whose union equals the universe. The set cover problem is to identify the smallest sub-collection Read More …

Problem Detail: I’ve read in “Introduction to Algorithms” (CLRS) that formal language $L$ is NP-language if and only if there is a polynomial verification algorithm $A(x, y)$ and a constant $c$ such that $$L={xin{0,1}mid exists y text{ with } |y| leq Read More …

Problem Detail: I read this question somewhere, and could not come up with an efficient answer. A string of some length has beads fixed on it at some given arbitrary distances from each other. There are $k$ different types of beads Read More …

Problem Detail: I can define any boolean function (I think) using and and not, or using or and not (plus a constant 0 or 1). And I can define or in terms of xor. And then there are nor and nand. Read More …

Problem Detail: So, I know that the halting problem is undecidable for Turing machines. The trick is that TMs can decide recursive languages, and can accept Recursively Enumerable (RE) languages. I’m wondering, is there a more limited model of computation which Read More …