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 …
Blog
[Solved]: Showing NP-hardness of HALF-SAT
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 …
[Solved]: Genetic Algorithm, Neural Network, Deep Learning, Machine Learning Similarities and Applications?
Problem Detail: I am a computer engineering student and trying to get the idea behind all these Artificial Intelligence Concepts and applications. I know little theoretically about machine learning and some high level brief introduction of artificial intelligence as a whole Read More …
[Solved]: Tasks in which recursion is either the fastest or only way to produce a result
Problem Detail: I’ve just finished studying recursion at university. One thing that stood out for me however was that in both the lectures and in the practical we completed, all the tasks we were asked to do could be performed faster, 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 …
[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]: 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]: Why is a program with only atomics in SC-DRF but not in HRF-direct?
Problem Detail: In the paper “Heterogeneous-Race-Free Memory Models” [1], the authors state that a program consisting only of atomic is race free in SC-DRF but it is not in HRF-direct. I am not able to understand why this is. Can anyone Read More …
[Solved]: Standard notation for the language of the universal Turing machine?
Problem Detail: The universal Turing machine $U_{TM}$ is a TM that takes in as input an encoding of a TM and a string, then runs the TM on the string and does whatever the simulated TM does. The language of the Read More …
[Solved]: What is semantic closure?
Problem Detail: In the context of database theory, what does semantic closure mean (linguistically speaking, i.e. not the mathematical definition) If X is the set of attributes of $F$, then the semantic closure $F^+$ of $F$ is defined as follows: $F^+={$ Read More …
