Author: ignougroup

Problem Detail: We know that DFAs are equivalent to NFAs in expressiveness power; there is also a known algorithm for converting NFAs to DFAs (unfortunately I do now know the inventor of that algorithm), which in worst case gives us $2^S$ Read More …

Problem Detail: I’m a little stuck on this question, any help would be appreciated! Given that the Hamiltonian Path (HP) and the Hamiltonian Circuit/Cycles (HC) problems are known to be NP-complete, show that HCE is NP-complete. HCE: Given an undirected graph Read More …

Problem Detail: I guess at the heart of this is that I don’t really understand hash functions. One article says any function mapping objects to an object of fixed size: A hash function usually means a function that compresses, meaning the Read More …

Problem Detail: Say that $a_1a_2ldots a_n$ and $b_1b_2ldots b_n$ are two strings of the same length. An anagramming of two strings is a bijective mapping $p:[1ldots n]to[1ldots n]$ such that $a_i = b_{p(i)}$ for each $i$. There might be more than Read More …

Problem Detail: The GSAT algorithm is, for the most part, straight forward: You get a formula in conjunctive normal form and flip the literals of the clauses until you find a solution that satisfies the formula or you reach the max_tries/max_flips Read More …

Problem Detail: I want to scheduling $n$ teams using divide and conquer method for $n in mathbb{N}$.My approach is that if $n$ is even divide it to to group $frac{n}{2}$ and $frac{n}{2}$ but if $n$ is odd, add auxiliary team and Read More …

Problem Detail: Has some sort of canonical – or reference – implementation of Dual-pivot Quicksort been posted anywhere? I would like to include that algorithm in a comparison among sorting algorithms for a specialized need that I have, but the Java Read More …

Problem Detail: In her 1987 seminal paper Dana Angluin presents a polynomial time algorithm for learning a DFA from membership queries and theory queries (counterexamples to a proposed DFA). She shows that if you are trying to learn a minimal DFA Read More …