Blog

Problem Detail: I was wondering what the complexity of the following problem is: Given: A flow network $N$ with a source $s$, sink $t$ and a number $k$. Question: Is there an $s$-$t$ cut of capacity at most $k$? Obviously, the Read More …

Problem Detail: In unification, given a set of equations, a standard problem is to compute a most general unifier (mgu). I am interested in a somewhat reversed problem. Imagine having a set of equations that do not have an mgu, like Read More …

Problem Detail: I am investigating PAC learning (computational learning theory) as a beginner with no previous knowledge of machine learning / AI. I am investigating the model mainly from a historical point of view. For this, the most important things are Read More …

Problem Detail: We are given an array $A[1..n]$ of integers, and an array of 3-tuples known as queries. The query tuples $(i,j,v)$ denote additions of an integer $v$ to the subarray of $A[i..j]$. I’m interested in the query time of $A[k]$ 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 …

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: 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: 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: 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: 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 …