Blog

Problem Detail: One of my courses introduced the following question: Given the recurrence relation for mergesort: $T(n) = 2T(n/2) + n$ How would the following parameter passing strategies influence the relation and running time of the algorithm: A pointer to the Read More …

Problem Detail: I’m writing a JavaScript library for calculating graph measurements such as degree centrality, eccentrality, closeness and betweenness. In order to validate my library I use two exist applications Gephi and NodeXL to run calculation with them. The problem is Read More …

Problem Detail: Trivially decidable problem is one in which the problem is a known property of the language/grammar. So intersection of two regular languages is regular should be trivially decidable? But it is given as not trivially decidable. Asked By : user1771809 Read More …

Problem Detail: Are there any CS problems, preferably open, that are related to music or musical theory somehow? I would think of problem with musical notation but also probabilities when randomizing according to a scale or a tonality or general what Read More …

Problem Detail:  AB 00 01 11 10 00 | x | 1 | 0 | 1 | CD 01 | 0 | 1 | x | 0 | 11 | 1 | x | x | 0 | 10 | Read More …

Problem Detail: I was solving this question. It is as follows Joe picks an integer from the list $1,2,cdots,N$ with a probability $p_i$ of picking $i$ for all $1leq i leq N$. He then gives Jason $K$ attempts to guess his Read More …

Problem Detail: Set cover is NP-complete given an arbitrary set $U$, a set $S$ of subsets of $U$, and an integer $k$. However, what if $k$ is always a constant 3? Is that problem still NP-complete? Asked By : TheJKFever Answered By Read More …

Problem Detail: The master method allows us to solve certain recurrences of the form $$T(n) = aT(n/b)+f(n),,$$ where $age1$ and $b>1$ are constants and $f(n)$ is a positive function with some further restrictions that aren’t important for this question. The above Read More …

Problem Detail: Let Two-Solutions-SAT be the language of Boolean formulas that have exactly two distinct satisfying assignments. Show Two-Solutions-SAT is co-NP-hard. I know how to show that the complement of Two-Solutions-SAT is in NP, it’s relatively easy to create a nondeterministic Read More …

Problem Detail: Currently, I’m delving into Analysis of Algorithms and I’ve discovered that I would need to improve my knowledge of Probability Theory. Any recommendation? Where do I start? Thanks in advance! Asked By : vicentazo Answered By : Wandering Logic The best Read More …