Category: Uncategorized

Problem Detail: I have as an assignment question to show that $QuadSat={langlephiranglemidphi$ is a satisfiable 3CNF formula with at least 4 satisfying assignments$}$ is $sf NP$-Complete. My solution is as follows, which is pretty much copied almost 100% from a textbook Read More …

Problem Detail: I read on Wikipedia and in lecture notes that if a lossless data compression algorithm makes a message shorter, it must make another message longer. E.g. In this set of notes, it says: Consider, for example, the 8 possible Read More …

Problem Detail: I am trying to find out why $(log(n))^{99} = o(n^{frac{1}{99}})$. I tried to find the limit as this fraction goes to zero. $$ lim_{n to infty} frac{ (log(n))^{99} }{n^{frac{1}{99}}} $$ But I’m not sure how I can reduce this Read More …

Problem Detail: Given a $0,1$ (binary) integer program of the form: $$ begin{array}{lll} text{min} & f(x) & text{s.t.} &Avec{x} = vec{b} & quad forall i &x_ige 0 & quad forall i &x_i in {0,1} & quad forall i end{array} $$ Note: Read More …

Problem Detail: I understand the basis of A* as being a derivative of Dijkstra, however, I recently found out about D*. From Wikipedia, I can understand the algorithm. What I do not understand is why I would use D* over Dijkstra. Read More …

Problem Detail: In my lecture notes, the definition of the class NP is given as: A language $L$ is in the class NP, if there exists a turing machine $M$ and polynomials $T$ and $p$ such that: For every input $x$, Read More …

Problem Detail: I’m still new to CFG and CNF and have trouble sometimes understanding the concepts. I’m trying to convert this CFG into Chomsky Normal Form: G: S -> aSbS | bSaS | epsilon I think the language generates all strings Read More …