IgnouGroup Social Campus
Problem Detail: Given $n$ jobs $J_1,J_2,…,J_n$, each job requires $T_i > 0, T_i in N$ time to complete. Each job must be pre-processed and post-processed by a single machine M that can handle only 1 job at a time and both Read More …
Problem Detail: A student recently asked me to check an NP-hardness proof for them. They performed a reduction along the lines of: I reduce this problem $P’$ that is known to be NP-complete to my problem $P$ (with a poly-time many-one Read More …
Problem Detail: I’m trying to prove that $L_1={langle Mrangle mid M text{ is a Turing machine and visits } q_0 text{ at least twice on } varepsilon} notin R$. I’m not sure whether to reduce the halting problem to it or Read More …
Problem Detail: I see the problem here which is the well know partition problem but with constraint that the size of both sets must be equal. I look at the answer and I don’t understand that why Colin said add max(S)⋅length(S), Read More …
Problem Detail: Got a simple construction seemingly contradicting a paper assuming plausible conjecture. Since it is unlikely the conjecture to be false, what is wrong with the argument? From a paper An AND-compression is a deterministic polynomial-time algorithm that maps a Read More …
Problem Detail: I have some questions regarding tree search and graph search (Uninformed search) as explained in chapter 3 of the book : http://aima.cs.berkeley.edu/ As I see, the only difference between the two is that the graph search handles loops (avoids Read More …
Problem Detail: Before I’ll ask my question, let me start with my understanding of the definitions, to prevent myself with further confusion, as well as giving some background. Huffman Code is the binary-code induced from a binary tree, constructed by Huffman’s Read More …
Problem Detail: From Wikipedia: The type of computational problem: The most commonly used problems are decision problems. However, complexity classes can be defined based on function problems, counting problems, optimization problems, promise problems, etc. I also saw the definitions of NP-complete, Read More …
Problem Detail: I’m trying to interpolate a logarithmic function but it always reaches a singularity due to $log(0)$ being $-infty$ is there a correct way to interpolate logarithmic functions? (as in correct parameters) What i’m currently going for is $y=a+b log(cx)$ Read More …
Problem Detail: I came across the following theorem in Sipser’s about incompressible strings. Let $;f$ be some computable function which holds for almost all strings. The for any $b > 0 $, the property $;f$ is false only on finitely many Read More …
