Author: ignougroup

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 …

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: 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: 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 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: I’m trying to construct the small-step semantic rules involving the for-loops, but I can’t find anything about it in the literature (only about while-loops). I was wondering if anyone could help me out with this? This is a first Read More …

Problem Detail: The case of multiple strings. A slight modification of the dynamic programming algorithm for two strings is used as a subroutine. Here is the pseudo code: # The modified dynamic programming algorithm for longest common subsequence. # Inputs: x, Read More …

Problem Detail: Suppose we have a graph $G = (V, E, w:ein E to x in {0,1})$. That is, a set of vertices, a set of edges and a weight function that assigns edges weights of 0 or 1. Suppose we Read More …