Problem Detail: My setup is something like this: I have a sequence of sets of integers $C_i (1leq ileq n)$, with $|C_i|$ relatively small – on the order of four or five items for all $i$. I want to choose a Read More …
Category: Uncategorized
[Solved]: Closure under intersection of context free binary trees
Problem Detail: Some sets of ordered binary trees can be represented as a CFG with rules of the form A -> aBC A -> b Where A,B,C are nonterminals and a and b are terminals representing internal nodes and leaf nodes Read More …
[Solved]: A simple question on #P
Problem Detail: Wiki (http://en.wikipedia.org/wiki/Sharp-P) says ‘In computational complexity theory, the complexity class #P (pronounced “number P” or, sometimes “sharp P” or “hash P”) is the set of the counting problems associated with the decision problems in the set NP’. Is there Read More …
[Solved]: what is the complexity of recurrence relation?
Problem Detail: what is the complexity of below relation $ T(n) = 2*T(sqrt n) + log n$ and $T(2) = 1$ Is it $Theta (log n * log log n)$ ? Asked By : panthera onca Answered By : Ken P Yes, the Read More …
[Solved]: More than one NFA accepting a given language
Problem Detail: While going through certain problems. it seems that more than one NFA is possible for the given language. Is it so? For example for drawing: NFA ending with 1 where $Sigma={0,1}$ is and also we can draw one without Read More …
[Solved]: Probability of Success in Slotted Medium Access
Problem Detail: Suppose you have a network which uses time division multiplexing (i.e. Slotted Aloha). There are $N$ nodes each transmitting in a given slot with probability $p$. I understand that the probability a node is successful in a slot is Read More …
[Solved]: How a reduction can help up solve a problem?
Problem Detail: I am studying the basics of Computation Theory and I came up with an example I can’t understand. Let’s have a language $L = {langle Mrangle mid L(M) = Sigma^{ast} }$, so $L$ contains codes of all Turing machines Read More …
[Solved]: CTL vs LTL – when a formula satisfy a model
Problem Detail: I’m trying to understand the difference between LTL and CTL. In particular, i’m trying to understand when a model (a transition system eg. Kripke structure) satisfy a formula. This is my point of view: a model satisfy an LTL Read More …
[Solved]: Equivalent Straight Line Embedding of a Planar Graph Drawing on a Grid
Problem Detail: An embedding of a graph G on a surface Σ is a representation of G on Σ in which points of Σ are associated to vertices and simple arcs are associated to edges in such a way that: the Read More …
[Solved]: Counting inversion pairs – $n^2$ results in $n log n$ time?
Problem Detail: The number of possible inversions in an array is bounded by $binom{n}{2}$, i.e $frac{n(n-1)}{2} in O(n^2)$. How it is possible to calculate $O(n^2)$ results in $O(nlog n)$ time using something like modified merge sort? (sample algo : http://www.geeksforgeeks.org/counting-inversions/). Asked Read More …
