Blog

Problem Detail: My best attempt at a specific case of the problem where $n =$ 256: For a specific case that a RB tree has 256 nodes, we can use the RB tree theorem to deduce that the height of the Read More …

Problem Detail: $L = left { a^{c}mid text{c is a composite number} right }$ I feel that this is not a context-free language as checking this constraint requires divisibility checking, but I am facing a hard time in proving that $L$ Read More …

Problem Detail: In type theories, like Coq’s, we can define a type with parameters, like this: Inductive ListP (Element : Type) : Type := NilP : ListP Element | ConsP : Element -> ListP Element -> ListP Element. Alternatively, we can Read More …

Problem Detail: Given a set of data points $X = {x_1, x_2, ldots, x_m}$ where $x_i in mathbb{R}^d$ we run K-means on $X$ and obtain the clusters $c_1, c_2, ldots, c_k$. Now, if we create a new dataset $Y = {y_1, Read More …

Problem Detail:  $L_1$ is a recursively enumerable language over some alphabet $Sigma$. An algorithm effectively enumerates its words as $w_1, w_2, …$. $L_2$ is another language over $Sigma cup {#}$ as ${w_i#w_j : w_i, w_j in L_1, i < j}$ Read More …

Problem Detail: Is there a sequence of undirected graphs ${C_n}_{nin mathbb N}$, where each $C_n$ has exactly $n$ vertices and the problem Given $n$ and a graph $G$, is $C_n$ an induced subgraph of $G$? is known to be in class Read More …

Problem Detail: I know that CNF SAT is in NP (and also NP-complete), because SAT is in NP and NP-complete. But what I don’t understand is why? Is there anyone that can explain this? Asked By : user2795095 Answered By : vzn Try Read More …