Problem Detail: If ${sf P}$ does in fact equal ${sf NP}$, how would this enhance our algorithms to factor integers faster. In other words, what kind of insight would this fact give us in understanding integer factorization better? Asked By : Mike Read More …
Category: Uncategorized
The physical implementation of quantum annealing algorithm
Problem Detail: From that question about differences between Quantum annealing and simulated annealing, we found (in commets to answer) that physical implementation of quantum annealing is exists (D-Wave quantum computers). Can anyone explain that algorithm in terms of quantum gates and Read More …
Subtracting lower-order term to prove subtitution method works
Problem Detail: Substation method fails to prove that $T(n)=Theta(n^2) $ for the recursion $T(n)=4T(n/2) + n^2$, since you end up with $T(n) < cn^2 leq cn^2 + n^2$. I don’t understand how to subtract off lower-order term to prove that substitution Read More …
Algorithms with polynomial time complexity of higher order
Problem Detail: I was learning about algorithms with polynomial time complexity. I found the following algorithms interesting. Linear Search – with time complexity $O(n)$ Matrix Addition – with time complexity $O(n^2)$ Matrix Multiplication – with time complexity $O(n^3)$ Is there any Read More …
Define a list using only the Hindley-Milner type system
Problem Detail: I’m working on a small lambda calculus compiler that has a working Hindley-Milner type inference system and now also supports recursive let’s (not in the linked code), which I understand should be enough to make it Turing complete. The Read More …
Does spanning tree make sense for DAG?
Problem Detail: Why cannot I find any information about spanning tree for DAG ? I must be wrong somewhere. Asked By : zell Answered By : Dai Why focusing on dags and not general directed graphs? I think you should have a look Read More …
A median of an AVL. How to take advantage of the AVL?
Problem Detail: Here is the source of my question. Given a self-balancing tree (AVL), code a method that returns the median. (Median: the numerical value separating the higher half of a data sample from the lower half. Example: if the series Read More …
Why is a regular language called ‘regular’?
Problem Detail: I have just completed the first chapter of the Introduction to the Theory of Computation by Michael Sipser which explains the basics of finite automata. He defines a regular language as anything that can be described by a finite Read More …
Number of possible search paths when searching in BST
Problem Detail: I have the following question, but don’t have answer for this. I would appreciate if my method is correct : Q. When searching for the key value 60 in a binary search tree, nodes containing the key values 10, Read More …
Partitions of a directed graph – common prey and common enemy partitions
Problem Detail: Let $D=(V,E)$ be a finite directed graph with no isolated nodes(from every node there is at least one edge entering and one exiting). For $v in V$ define the following sets: $$v^+= left{w in V|(v,w)in E right}, v^-= left{w Read More …
