Problem Detail: Yesterday I wrote my undergraduate exam in complexity theory. I had to leave off one question, which bugs me since then. Consider: $$ HALF-SAT = { varphi mid varphi text{ is a formula which is satisfied by at least Read More …
Category: Uncategorized
[Solved]: Does a graph always have a minimum spanning tree that is binary?
Problem Detail: I have a graph and I need to find a minimum spanning tree to a given graph. What is to be done so that the output obtained is a binary tree? Asked By : Aditya.M Answered By : Juho There is Read More …
[Solved]: Calculate winding number
Problem Detail: How can one calculate the winding number of a polygon given as a list of vertices in some (counter-clockwise or clockwise) order? The complexity of the algorithm must be linear time. Asked By : Dib Answered By : ZeroUltimax The winding Read More …
[Solved]: Can a Turing Machine decide if a regular expression matches all strings of exactly some length $l geq 1$?
Problem Detail: Earlier I asked the question: Can a Turing Machine decide if an NFA accepts a string of prime length?. The answer introduced me to Parikh’s theorem, which I’ve been reading about. The concept of Parikh’s theorem, if we apply Read More …
[Solved]: Cantor’s diagonal method in simple terms?
Problem Detail: Could anyone please explain Cantor’s diagonalization principle in simple terms? Asked By : user5507 Answered By : William Macrae Here’s the standard application explained in the simplest terms I can: Theorem: There are more real numbers than there are integers. Lemma: Read More …
[Solved]: Asymptotic Properties of Functions in Complexity Analysis
Problem Detail: When dealing with the analysis of time and space complexity of algorithms, is it safe to assume that any function which has tight bounds ( i.e. $f(n)=Theta(g(n))$ is asymptotically positive and asymptotically monotonically increasing. I mean that for all Read More …
[Solved]: Difference between hypervisor and exokernel
Problem Detail: An hypervisor (1st type) is a software that creates and run virtual machines, managing guest’s operative systems’s requests to the hardware. An exokernel is an operative system kernel, that let’s programs access directly to the hardware or, with the Read More …
[Solved]: Traveling Salesman Problem with Neural Network
Problem Detail: I was curious if there were any new developments in solving the traveling salesman problem using something like a Hopfield recurrent neural network. I feel like I saw something about recent research getting a breakthrough in this, but I Read More …
[Solved]: Does Max-SNP hard imply NP-hard
Problem Detail: I have difficulties understanding the definition of the class Max-SNP (optimization variant of strict NP), thus I have to following basic question: If a problem is known to be Max-SNP hard, does this imply NP-hardness of the problem? Asked Read More …
[Solved]: Can Shortest Job First Scheduling be subject to convoy effect?
Problem Detail: Look at the below table for example : Look at the Non-Preemptive SJF table Suppose if the burst time of process $P_1$ was a very large number compared to $7$, the processes $P_3,P_2$ and $P_4$ have to wait for Read More …
