Problem Detail: I want to study Artificial Intelligence from Artificial Intelligence: A Modern Approach by Russell and Norvig, in the mid-year vacation. I want to get prepared before diving into the book so I decided to review some relevant subjects like Read More …
Author: ignougroup
[Solved]: Can OR be “undone”?
Problem Detail: Suppose that $Z = X vee Y$, where $X$, $Y$ and $Z$ are 96-bit binary numbers. If I’m given the values of $Z$ and $Y$, is it possible to work out what $X$ is? I know this is possible with XOR but Read More …
[Solved]: Concept of reduction and algorithm
Problem Detail: Suppose that someone found an algorithm A for a NP problem (that is not NP-complete) that uses an algorithm B for PSPACE-complete or #P-complete problem during execution. (Remaining part of the algorithm takes polynomial time.) Then suppose there is Read More …
[Solved]: What is meant by superlinear speedup? Is it possible to have superlinear speedup in practice?
Problem Detail: In parallel computing, I know the speed up equation is $$ frac{1}{ s + frac{1-s}{p} } $$ But what is meant by superlinear speed up? Is it something theoritical? Could you explain it with equations? Asked By : LuckyB Answered Read More …
[Solved]: Closest pair of points in a Plane
Problem Detail: I want to write an algorithm to find the closest pair of points among n points in an XY-plane. I have the following approach in my mind: Find the minimum x co-ordinate(minX) and minimum y(minY) co-ordinate. Name the point Read More …
[Solved]: Algorithm for a list of best solutions to the Assignment problem
Problem Detail: I am trying to brute force a classical substitution cipher. The problem is that there are $26!$ possible keys. So, I’d like to do frequency analysis to try likely keys first. Then, on the first $n$ tries I will Read More …
[Solved]: Is this probability distribution data structure already discovered?
Problem Detail: Problem formulation I have implemented an interesting probability distribution data structure: having $n$ elements $a_1, a_2, dots, a_n$ in the data structure with respective positive weights $w_1, w_2, dots, w_n > 0$, upon request each $a_i$ may be returned Read More …
[Solved]: Finding farthest item in an array with duplicates
Problem Detail: I have an array $A[]$ of size $L$, which contains numbers in the range $1 ldots N$. Here $L>N$, so the array will contain repetitions. If $x,y$ are two numbers that are both present in the array, define the Read More …
[Solved]: Show that a regular language L contains only palindromes if and only if all words of length at most 3n are palindromes
Problem Detail: This is an extension of a previous question asked by a different user earlier: Let $x, u, v, w, y, x’, u’, v’, w’, y’$ be words satisfying $y’x’ = xy$. $y’u’x’ = xuy$. $y’v’x’ = xvy$. $y’w’x’ = Read More …
[Solved]: Travelling with the most efficient path
Problem Detail: A friend of mine actually asked me a very interesting computer science related question, and I have been stuck on it for a long time. The problem is: you have to travel $1000$ km. The only gas station is Read More …
