Problem Detail: You are given a bunch of nodes evenly spaced in a rectangular grid. The rectangle is M nodes long and N nodes wide. Node A is in the upper left hand (northwest) corner and node B is at the Read More …
Category: Uncategorized
[Solved]: Can there be two different left most derevations for a grammar?
Problem Detail: Suppose there is a CFG with the rules S–> Aa A–> Bb B–> A B–> Epsilon To my best understanding the left most derivation would go like this.. S==> Aa ==> Bba ==> Aba ==> Bbba ==> bba or Read More …
[Solved]: How to apply a 1-qubit gate to a single qubit from an entangled pair?
Problem Detail: Reading about superdense coding I came upon a calculation I can not understand. We have an EPR entangled pair of qubits $frac{1}{sqrt2}(|00rangle + |11rangle)$ and we want to apply a Pauli X gate to the first of the entangled Read More …
[Solved]: Clarification on Tabu Search
Problem Detail: I need some help in understanding the ‘Tabu Search‘ Algorithm. (Wikipedia) I miss a simple explanation to Tabu Search. Anyway, I’m trying to refer to available resources and build an understanding. This is what I’m trying to ‘digest’: Tabu Read More …
[Solved]: Modeling the problem of finding all stable sets of an argumentation framework as SAT
Problem Detail: As a continuation of my previous question i will try to explain my problem and how i am trying to convert my algorithm to a problem that can be expressed in a CNF form. Problem: Find all stable sets Read More …
[Solved]: How is the key in a private key encryption protocol exchanged?
Problem Detail: Windows NT used a point-to-point protocol where a client can communicate “securely” with a server by using a stream cipher to encrypt an array of messages with some key $k$. The server also encrypts its response with the same Read More …
[Solved]: Recursive, Recursively Enumerable and None of the Above
Problem Detail: Let $A = mathrm{R}$ be the set of all languages that are recursive, $B = mathrm{RE} setminus mathrm{R}$ be the set of all languages that are recursively enumerable but not recursive and $C = overline{mathrm{RE}}$ be the set of Read More …
[Solved]: Context-free grammar for $L = {a^{2^k}, k inmathbb{N}}$
Problem Detail: In an exercise, I am asked to find a context free grammar for language $L = {a^{2^k}, k in mathbb{N}}$. I have been trying to use a “doubling” variable. If $a^{2n} in L, ninmathbb{N}$ then use this variable to Read More …
[Solved]: What type of algorithms are faster with a quantum computer?
Problem Detail: I am a beginning CS student and I am learning algorithms. I heard that even with quantum computers, that general sorting algorithms can never have better than $nlog n$ time. However, I also know that factoring algorithms would be Read More …
[Solved]: Order-preserving update of a sublist of a list of mutable objects in sublinear time
Problem Detail: Description Say I have a source list like: [“a”,”b”,”c”,”d”] and want to run a capitalization filter so if I change, “b” to “B”, my derived list looks like [“B”]. Next, if I change my source list’s “d” to Read More …
