Category: Uncategorized

Problem Detail: Consider the following protocol, meant to authenticate $A$ (Alice) to $B$ (Bob) and vice versa. $$ begin{align*} A to B: &quad text{“I'm Alice”}, R_A B to A: &quad E(R_A, K) A to B: &quad E(langle R_A+1, P_Arangle, K) end{align*} Read More …

Problem Detail: I just read Can this algorithm still be considered a Binary Search algorithm? and recalled that a few years back I wrote an indexer/search for log files to find log entries in large plain text files by date/time window. Read More …

Problem Detail: What books would you recommend for someone starting B.Sc in Computer Science? My Personal Info: I am currently looking at B.Sc in Computer Science (Games), which is computer science, accept for the last year which is tailored more towards Read More …

Problem Detail:  HALT$_{TM}$ is the set of all machine-input pairs $<M,w> $ where $M$ halts on input $w$ The complement of HALT$_{TM}$ is the set of all machine-input pairs $<M,w> $ where $M$ doesn’t halt on input $w$ Show that 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 …

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: 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: 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: My aim is to classify types of cars (Sedans,SUV,Hatchbacks) and earlier I was using corner features for classification but it didn’t work out very well so now I am trying Gabor features. code from here Now the features are Read More …

Problem Detail: I’m looking at the following problem: Given $n$-dimensional vectors of natural numbers $v_1, ldots, v_m$ and some input vector $u$, is $u$ a linear combination of the $v_i$’s with natural number coefficients? i.e. are there some $t_1, ldots, t_m Read More …