Blog

Problem Detail: If the definition of Initial Algebra is: “An object is initial if there exists a unique morphism from the object to every object in the category” Why do we need such object, and could any one give an example Read More …

Problem Detail: I am seeking a fast algorithm to compute the following function, a quantile of the Poisson distribution: $$f(n, lambda) = e^{-lambda} sum_{k=0}^{n} frac{lambda^k}{k!} $$ I can think of an algorithm in $O(n)$, but considering the structure of the series, Read More …

Problem Detail: We have an array of Integers, $A[]$ and we have to find the minimum number that is not the sum of a subset of array using the elements from $L$ to $R$ indices. I was thinking of using coin Read More …

Problem Detail: We know Every conflict serializable schedule is serializable, but not all serializable schedules conflict-serializable. (*) so it means there is at least one serializable schedule that not conflict serializable. One way of Testing conflict serializability is using Directed graph Read More …

Problem Detail: I’m trying to build an algorithm which takes two lists of natural numbers and finds if every element of the first list is displayed at least once in the second list. What if the list is sorted? An algorithm Read More …

Problem Detail: $L := {w in {0,1}^* | $the length of $w$ is odd $ wedge $ 1 is in the middle of $w}$ So the alphabet is ${0,1}^*$. My problem is that I can’t keep track of the equality of Read More …

Problem Detail: I am looking for algorithms to optimize a strictly monotonic function $f$ such that $f(x) < y$ $f : [a,b] longrightarrow [c,d] qquad text{where } [a,b] subset {mathbb N}, [c,d] subset {mathbb N}$ such that $argmax{_x} f(x) < y$ Read More …

Problem Detail: I have to explain how a 2-PDA works and then write a program (in Delphi) which simulates a 2-PDA step by step for the language $L = {w$w | w ∈ {0,1}^n with n>0}$. So far, so good. Now Read More …

Problem Detail: I am working on a problem where I am supposed to count the number of arrays of size $Ntimes M$ where the sum of elements in the $i$-th row is greater than or equal to the the sum of Read More …