Author: ignougroup

Problem Detail: Is there ANY compression type that can compress a file, and then that compressed file can be searched without uncompressing the file? Asked By : Albert Renshaw Answered By : KWillets Compressed self-indexes such as the FM Index allow arbitrary substring Read More …

Problem Detail: IPv6 addresses in the form of 862A:7373:3386:BF1F:8D77:D3D2:220F:D7E0 are much harder to memorize or even transcribe than the 4 octets of IPv4. There have been attempts to mitigate this, making IPv6 addresses somehow more memorable. Is there an intentionally-weak hashing Read More …

Problem Detail: I understand that a regular language can be specified by either regular or non-regular grammars. What is an example of a non-regular grammar for a regular language? Asked By : espertus Answered By : atulgangwar Regular Language L = {aab} Non-regular Read More …

Problem Detail: I read somewhere that, if $Aleq_p B$ and $Bleq_p A$, then it is said that $Aequiv_p B$. What exactly does this mean? Is it saying that both $A$ and $B$ are the exact same level of complexity? Asked By 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: $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’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: 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: 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: 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 …