Category: Uncategorized

Problem Detail: I was wondering if finding if a graph has k or more isolated nodes is a NP-Complete problem. I found the following problem: Prove that the following problem is NP-Complete. Given a set of T transactions: $T = {t_1,t_2,dots,t_m}$ Read More …

Problem Detail: In a lecture a professor mentioned that modern computers don’t have as much computational power as a Turing machine because they don’t have infinite memory, and since no computer can have infinite memory the Turing machine is therefore unattainable Read More …

Problem Detail: I’ve seen circuit level implementations of ALU’s before, but how are NOT/AND/ADD performed mechanically? Asked By : Wuschelbeutel Kartoffelhuhn Answered By : slebetman Babbage’s arithmetic unit (ALU) for the Analytical Engine was originally called the mill. It wasn’t constructed out of Read More …

Problem Detail: I have a binary heap with $n$ elements. I want to get the $k$ largest elements in this heap, in $O(k log k)$ time. How do I do it? (Calling deletemax $k$ times yields a $O(k log n)$ complexity. Read More …

Problem Detail: I am trying to derive the classic paper in the title only by elementary means (no generating functions, no complex analysis, no Fourier analysis) although with much less precision. In short, I “only” want to prove that the average Read More …

Problem Detail: Consider the following version of the Clique problem where the input is of size $n$ and we’re asked to find a clique of size $k$. The restriction is that the decision procedure cannot change the input graph into any Read More …

Problem Detail: I’m currently in a class on Computability and we just finished looking at formal grammars before moving onto finite automata. We were given an several examples of a formal grammar, and one stuck out in particular: V: { S, Read More …

Problem Detail: How do you write the CFG for the following language: {ax by c ax+y} Is there some formula or rules I need to follow? An explanation will be so appreciated. What I tried is: First I broke ax+y into Read More …

Problem Detail: Cache-oblivious algorithms and data structures are a rather new thing, introduced by Frigo et al. in Cache-oblivious algorithms, 1999. Prokop’s thesis from the same year introduces the early ideas as well. The paper by Frigo et al. present some Read More …