Author: ignougroup

Problem Detail: I am looking for articles relating to algorithms that deal with automatic selection of seating assignment. I need an algorithm (preferably more than one) that can automatically select a seating place while enforcing certain constraints that are predefined. Originally Read More …

Problem Detail: Why do most programming languages (if not all) lack a 2-bit data type? A boolean is a single bit with the values being either true or false. Why is there no native, corresponding type where the values can be Read More …

Problem Detail: A path is simple if it repeats no vertices. How many simple paths between two vertices in Complete graph? One way is listing the simple paths is to use depth-first search. but i think it should be simple to Read More …

Problem Detail: If I understand correctly, the complexity of solving a computational problem is defined in terms of which instance $I$ of the problem, what size $n$ of the problem instance, and what algorithm $A$ for solving the problem instance. Is Read More …

Problem Detail: The Rabin–Karp string matching algorithm requires a hash function which can be computed quickly. A common choice is $$ h(x_0ldots x_n) = sum_{i=0}^n b^i x_i, $$ where $b$ is prime (all computations are module $2^w$, where $w$ is the Read More …

Problem Detail: Let $L_1, L_2$, two regular languages and the operations: $$Mix_1(L_1, L_2) ={ a_1b_1a_2b_2ldots a_nb_n | nge 0 land a_1,a_2,ldots ,a_n,b_1,b_2,ldots ,b_ninSigma land a_1a_2ldots a_nin L_1 , b_1b_2ldots b_nin L_2}$$ $$Mix_2(L_1, L_2) = { x_1y_1x_2y_2ldots x_ny_n | nge 0 land Read More …

Problem Detail: I read on the internet that it’s possible to reduce Clique to Vertex Cover. Almost everyone use this theorem: if a graph $G$ has a clique of size $k$ then the complement of $G$ has a vertex cover of Read More …

Problem Detail: Given the problem $EQ_{TM} = { langle M_1, M_2rangle mid M_1 text{ and } M_2 text{ are } TM, L_{M_1} = L_{M_2}}$, is it possible to prove that this is undecidable by using (a variant of) Rice theorem? I Read More …

Problem Detail: The problem Some people are crossing a bridge. Each one takes a different time to pass. Assume the people are sorted by their passing time increasingly. These are the conditions of crossing the bridge: only 1 or 2 people Read More …

Problem Detail: I’ve studied something about the Kolmogorov Complexity, read some articles and books from Vitanyi and Li and used the concept of Normalized Compression Distance to verify the stilometry of authors (identify how each author writes some text and group Read More …