Category: Uncategorized

Problem Detail: I am using a transmission system that uses a Bloom filter (this part is out of my control). I want to send a small amount of data (32 bits) using this system. For each bit [0,31], I add its Read More …

Problem Detail: SAT solvers are getting more and more efficient in solving large instances and are being used as back-ends in various contexts. Every time one wants to use them to solve a problem in a specific domain, he/she has to Read More …

Problem Detail: We have a graph $G=(V,E)$ and we need to divide this graph into two clusters $A$ and $B$. Some pairs of vertices $u$, $v$ should not be in the same cluster, and we define an edge $(u,v) in E$. Read More …

Problem Detail: I’m writing insertion sort in scheme, but due to the difficulty of writing it recursively within the constraints of list processing of scheme, I made what seems like an insignificant change to the “find lowest” or inner loop. I’ll Read More …

Problem Detail: what is the difference between memory access and data memory access? for example, here are the examples of register transfer language instructions: $R1 ←[18]$ $R2 ←[R1 +3]$ $R1 ← R1 +2$ $[8] ← R1$ From my understanding, memory access Read More …

Problem Detail: I have a very silly question, as I am reading through all the proofs showing a problem is NP hard, one of the techniques is by showing an already-proven NP complete problem is a special case for that problem. Read More …

Problem Detail: This came up while I was trying to answer this question on Wiring Length Minimization. I was going to call this the “polygamous marriage” problem, but the internet, so kittens. Yay! Suppose we have $M$ kittens that need to Read More …

Problem Detail: So in complexity theory, I’ve run across different definitions for NP problems — Decision problems where a solution can be verified by a DFA in polynomial time Decision problems where a solution can be found by an NFA in Read More …

Problem Detail: Standard busy beaver function draws attention to final count of nonzero symbols on tape. We could instead look at largest amount of nonzero symbols appearing on tape at any point of computation. This function’s lower bound would be $Sigma(n)$ Read More …

Problem Detail: $newcommandldotd{mathinner{..}}$Given that $A[1ldotd n]$ are integers such that $0le A[k]le m$ for all $1le kle n$, and the occurrence of each number except a particular number in $A[1ldotd n]$ is an odd number. Try to find the number whose Read More …