Problem Detail: I would be surprised if this isn’t a well-studied problem, but I’m not sure what else to search for at this point: you’re given a set of binary $n$-vectors $S subset {0,1}^n$. The problem is to find another set Read More …
Blog
[Solved]: Parikh’s Theorem: CFL’s “contain” regular languages?
Problem Detail: The first sentence of the Wikipedia article for Parikh’s Theorem states: “Parikh’s theorem in theoretical computer science says that if one looks only at the relative number of occurrences of terminal symbols in a context-free language, without regard to Read More …
[Solved]: How does the Sutherland-Hodgman Algorithm work?
Problem Detail: The following are the Pages-96 and Page-97 of the book Schaum’s outline series of Computer Graphics. The algorithm considers several things: (1) Whether the polygon is Convex or Concave. (2) Whether the polygon is positively or negatively oriented. (3) Read More …
[Solved]: Can a computer count to infinity?
Problem Detail: So, could a computer count to infinity assuming it was a super computer and had near unlimited amounts of ram and hard drive/solid state drive storage? I am being serious when I ask this. [This is what I am Read More …
[Solved]: Number of Combinations of Connected Bipartite Graphs
Problem Detail: Given two sets of vertices $U$ (size $n$) and $V$ (size $m$), how many possibilities of set of edges $E$ exist that make the bipartite graph $G = (U, V, E)$ connected? Obviously there are $2^{n m}$ different set Read More …
[Solved]: How can an extended linearizable history G be equivalent to sequential history S?
Problem Detail: I am undertaking a module in Concurrent Programming where some of the new content this year covers linearizability, the Java Memory Model, and sequential consistency. Our class slides are companion slides to The Art Of Multiprocessor Programming. I have Read More …
[Solved]: Is the set-partition problem polynomial time reducible to the subset-sum problem?
Problem Detail: There are many solutions on the web showing that the subset-sum problem is polynomial time reducible to the set-partition problem. However, during my search, I came across the following powerpoint presentation (slide 12), where it says that the inverse Read More …
[Solved]: Logical Reduction
Problem Detail: Reducing one computable problem to another by providing an algorithm which transforms an instance of one problem to one of the other (and limiting the time or space of that algorithm) is clear to me. However, I fail to Read More …
[Solved]: If Halting problem is decidable, are all RE languages decidable?
Problem Detail: Assume the halting problem was decidable. Is then every recursively enumerable languagerecursive? Asked By : umang Answered By : Peter While we know for sure that the halting problem is (and always will be) undecidable by a Turing machine, we can Read More …
[Solved]: Does a shift operation distribute over XOR
Problem Detail: In this question, we abuse the mathematical notation to express bitwise operations in the following way: $ll$ is a binary left shift $oplus$ is a bitwise XOR $0b1, 0b110, 0b10 ldots$ are used to denote raw bits $repr$ is Read More …
