Category: Uncategorized

Problem Detail: I do not have any argument opposing why we need only a single universal class. However why not we have two universal classes, say an Object and an AntiObject Class. In nature and in science we find the concept Read More …

Problem Detail: When developing algorithms in quantum computing, I’ve noticed that there are two primary models in which this is done. Some algorithms – such as for the Hamiltonian NAND tree problem (Farhi, Goldstone, Guttman) – work by designing a Hamiltonian Read More …

Problem Detail: DFA, NFA and epsilon NFA all the three allow us to represent a particular regular language. With any of those representations we can arrive to the same regular expression, then why do we need to study all the three Read More …

Problem Detail: In the seminal distributed systems paper The Part Time Parliament (the Paxos protocol), Leslie Lamport names fictional legislators who are involved in the Paxon parliament protocol. According to this writing, he notes that: I gave the Greek legislators the Read More …

Problem Detail: I read on Wikipedia that unification is a process of solving the satisfability problem. At the same time, I know that such solvers are called “SAT solvers” or “SMT solvers”. So, are they different names for the same thing? Read More …

Problem Detail: In the following two threads I specified the question in the wrong way (easier to solve that way). Proving that finding wheel subgraphs is NP-complete Reducing from Hamiltonian Cycle problem to the Graph Wheel problem My sincere apologies.. I Read More …

Problem Detail: A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is __________. $O(n log n)$ $O(n^2 log n)$ $O(n^2 +log n)$ $O(n^2)$ My Read More …

Problem Detail: In an assignment I’ve been asked to find a CFG for $a^x b^y a^z b^w$, where, $x,y,z,w in mathbb{N}^+$, $y > x$, $z > w$, and $x+z = y+w$. A hint was given, think of the language as $(a^p Read More …

Problem Detail: BACKGROUND: Recently I tried to solve a certain difficult problem that gets as input an array of $n$ numbers. For $n=3$, the only solution I could find was to have a different treatment for each of the $n!=6$ orderings Read More …

Problem Detail: Suppose you had a set $P$ of people. Every person $p_j in P$ is familiar with atleast one other person $p_i$ (familiarity is symmetric). Is there a subset $S$ of people such that for $|S| ge k$, no two Read More …