Problem Detail: I have a number of questions about Paxos which I can’t answer in full confidence from reading the paper (Paxos Made Simple). My questions are loosely based around the following quote: In Paxos, a value is chosen when a Read More …
Author: ignougroup
[Solved]: Automated optimization of 0-1 matrix vector multiplication
Problem Detail: Question: Is there established procedure or theory for generating code that efficiently applies a matrix-vector multiplication, when the matrix is dense and filled with only zeros and ones? Ideally, the optimized code would make systematic use of previously computed Read More …
[Solved]: If A is poly-time reducible to B, is B poly-time reducible to A?
Problem Detail: Basically, is the following statement true? $A leq_p B$ $rightarrow$ $B leq_p A$ Asked By : robowolverine Answered By : Sasho Nikolov Short answer: No. For one example, take $A$ to be the language $A = {0, 1}^*$, i.e. the language Read More …
[Solved]: Is the relation between the input and output of an arbitrary algorithm describable by a mathematical function?
Problem Detail: I hope that this question is clear, and not off-topic: I have been reading about neural networks (in the AI sense), and the textbook said that an artificial neural network can always be described by a single mathematical function Read More …
[Solved]: How to show that the complement of a language in $mathsf P$ is also in $mathsf P$?
Problem Detail: If $L$ is a binary language (that is, $L subseteq Sigma = {0,1}^∗$) and $overline{L}$ is the complement of $L$: How can I show that if $L in mathsf P$, then $overline{L} in mathsf P$ as well? Asked By Read More …
[Solved]: Do non-computable functions grow asymptotically larger?
Problem Detail: I read about busy beaver numbers and how they grow asymptotically larger than any computable function. Why is this so? Is it because of the busy beaver function’s non-computability? If so, then do all non-computable functions grow asymptotically larger Read More …
[Solved]: Time complexity of solving a set of 2-sat instances?
Problem Detail: Suppose I have a set of 2-SAT instances, the set is of size $2^{3C}$ for some constant $C$. What is the time complexity of solving all instances using the fastest known 2-SAT solver? Asked By : chibro2 Answered By : hengxin Read More …
[Solved]: Tree decomposition – Fastest algorithm in practise
Problem Detail: I’m looking for a fast in practice algorithm for calculating the (preferable optimized) tree decomposition of a graph. I found the paper “A linear time algorithm for finding tree-decompositions of small treewidth” [1] by Hans L. Bodlaender which return Read More …
[Solved]: Is this a proper Max Heap Data Structure
Problem Detail: I was trying to understand the concept of Max-Heap. And to my understanding its a complete binary tree and each parent has a value greater than its children.The example I was going though had the following array which it Read More …
[Solved]: The most appropriate way to implement a heap is with an array rather than a linked list, why is this?
Problem Detail: The most appropriate way to implement a heap is with an array rather than a linked list, why is this? I don’t completely comprehend why this is? is it because it is easier to traverse? Asked By : cmehmen Answered Read More …
