Author: ignougroup

Problem Detail: Given three matrices $A, B,C in mathbb{Z}^{n times n}$ we want to test whether $AB neq C$. Assume that the arithmetic operations $+$ and $-$ take constant time when applied to numbers from $mathbb{Z}$. How can I state an Read More …

Problem Detail: I’m trying to prove/disprove two statements. I just want to make sure with you I’m on the right line. These are the following statements: Preface : Let A[n] be an array of min-heap (a min-heap represented by an array], Read More …

Problem Detail: When implementing TSP GA I decided for adjacency representation (i.e. $j$ value in $i$-th index means that node $j$ goes right after node $i$), as it enables interesting heuristical crossover operation (see Greffenstette, 1985). However this source, like many Read More …

Problem Detail: In many papers I’ve read that it is well known that the Shannon entropy of a random variable can be converted to min-entropy (up to small statistical distance) by taking independent copies of the variable. Can anyone explain to Read More …

Problem Detail: Can $R$ be inferred from $P$, $Q$, and $(P to Q) to R$ using only modus ponens? My understanding is that it can, as shown below, but I was told this was incorrect. Proof of ${P, Q, (P to Read More …

Problem Detail: Writing a proof by contradiction is fairly formulaic–first you assume the opposite, then derive a contradiction. I would like to know the steps and conventions for writing a many-one reduction proof. This answer was somewhat helpful, but like other Read More …

Problem Detail: Reading a book I was redirected to “On holy wars and a plea for peace” paper by Danny Cohen, which covers the “holy war” between big-endians and little-endians considering byte-order. Reaching the summary of the memory section I got Read More …

Problem Detail: Algorithms can either be oblivious or non-oblivious, but what is the actual difference between the two? Asked By : Summer Answered By : Evil Oblivious means that the control flow is independent of some properties of data. For example Bitonic Sort Read More …

Problem Detail: This language I think is not accepted by a deterministic one counter but accepted by a non-deterministic one counter : $L = {a^{i}b^{j}c^{k} mid (i=j) vee (j=k) text{ such that } igeq0, jgeq0, kgeq0}$ But how to prove this Read More …

Problem Detail: I’ve read that, incorporating many words(spatial locality) per cache blocks leads to lower miss rate. Is it the case always? One possibility of such approach is to make a single cache block of size equal to the size of Read More …