Category: Uncategorized

Problem Detail: (I’ve been stuck on this homework assignment for far too long) I need to find the number of independent sets in a tree. For example, say the set of nodes in a tree is {A, B, C, D, E}. Read More …

Problem Detail: The shannon entropy of a random variable $Y$ (with possible outcomes $Sigma={sigma_{1},…,sigma_{k}}$) is given by $H(Y)=-sumlimits_{i=1}^{k}P(Y=sigma_{i});log(P(Y=sigma_{i}))$. For a second random variable $X=X_{1}X_{2}…X_{n}$, where all $X_{i}$’s are independent and equally distributed (each $X_{i}$ is a copy of the same random Read More …

Problem Detail: What’s the complexity of Conflict-Driven Clause Learning SAT solvers, compared to DPLL solvers? Was it proven that CDCL is faster in general? Are there instances of SAT that are hard for CDCL but easy for DPLL? Asked By : asd Read More …

Problem Detail: The max k-cut problem is: Given an undirected graph G= (V;E) with nonnegative edge costs, and an integer k, find a partition of V into sets $S_1,cdots,S_k$ so that the total cost of edges running between these sets is Read More …

Problem Detail: The following is an excerpt from CLRS: $Theta(g(n))= { f(n) mid text{ $exists c_1,c_2,n_0>0$ such that $0 le c_1 g(n) le f(n) le c_2g(n)$ for all $n ge n_0$}}$. Assuming $n in mathbb{N}$, I was unable to find $f(n)$ Read More …

Problem Detail: Would switching the accept and reject states of an LBA A create a new LBA we’ll say A’ in which the language of A’ is the complement of the language of A? I believe the answer is yes just Read More …

Problem Detail: I am a high school student computationally studying the 3-dimensional structure of chromosomes by 40 kilobase loci. In a nutshell, loci that are close in space tend to express their genes at the same time ― loci are different Read More …

Problem Detail: Suppose I have an application with two threads, which both use the same resource. Normally, a synchronized block keeps these threads from messing with the resource in a way the user doesn’t expect. I understand why you do this, Read More …

Problem Detail:  l is a matrix of size [1…n, 1…n] function: rec(i,j) if (i*j == 0) return 1 else if (l[i,j] == 0) l[i,j] = 1 * rec(i-1,j) + 2 * rec(i,j-1) + 3 * rec(i-1,j-1) return l[i,j] end_function for Read More …

Problem Detail: I wanted to ask if someone can help me to construct a regular expression over the alphabet ${a,b,x}$ for the language $L$ which is constituted by all strings containing an odd number of $a$’s, and in which between each Read More …