Problem Detail: I am looking for a reference text on applied graph theory and graph algorithms. Is there a standard text used in most computer science programs? If not, what are the most respected texts in the field? I have Cormen Read More …
Category: Uncategorized
Extract Max for a max-heap in $log n + loglog n$ comparisons
Problem Detail: Given a max heap with extract-max operation. The basic version takes $2 log n$ comparisons. How can I make the running time just $log n + loglog n$ comparisons? How about $log n + logloglog n $ comparisons? I Read More …
Can constraint satisfaction problems be solved with Prolog?
Problem Detail: Is “party attendance” type of problems solvable in Prolog? For example: Burdock Muldoon and Carlotta Pinkstone both said they would come if Albus Dumbledore came. Albus Dumbledore and Daisy Dodderidge both said they would come if Carlotta Pinkstone came. Read More …
Types of reductions and associated definitions of hardness
Problem Detail: Let A be reducible to B, i.e., $A leq B$. Hence, the Turing machine accepting $A$ has access to an oracle for $B$. Let the Turing machine accepting $A$ be $M_{A}$ and the oracle for $B$ be $O_{B}$. The Read More …
Is an infinite union of context-free languages always context-free?
Problem Detail: Let $L_1$, $L_2$, $L_3$, $dots$ be an infinite sequence of context-free languages, each of which is defined over a common alphabet $Σ$. Let $L$ be the infinite union of $L_1$, $L_2$, $L_3$, $dots $; i.e., $L = L_1 cup Read More …
Advantages and disadvantages of microcoded vs hardcoded architectures
Problem Detail: Preamble I can’t understand what are the advantages and disadvantages of microcoded processor architecture and hardcoded one. Basically what I understood is that a microcode architecture divides an istruction in more microinstructions. I didn’t found much documentation written Read More …
Is resolution complete or only refutation-complete?
Problem Detail: Going through some knowledge representation tutorials on resolution at the moment, and I came across slide 05.KR, no77. There it is mentioned that “the procedure is also complete”. I think this completeness can not mean that if a sentence Read More …
Example of Soundness & Completeness of Inference
Problem Detail: Is the following example correct about whether an inference algorithm is sound and complete? Suppose we have needles a, b, c in a haystack, and have also an inference algorithm that is designed to find needles. sound – Only Read More …
Choosing a subset to maximize the minimum distance between points
Problem Detail: I have a set of points $C$, and I have the distance between each point $D(P_i,P_j)$. These distances are euclidean but the points are actually in a feature space. From the $C$ points I want to choose a subset Read More …
Confusion about big-O notation comparison of two functions
Problem Detail: On page 16 of this algorithms book, it states: For example, suppose we are choosing between two algorithms for a particular computational task. One takes $f_1(n) = n^2$ steps, while the other takes $f_2(n) = 2n + 20$ steps Read More …
