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 …
Category: Uncategorized
[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]: 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 …
[Solved]: Does PETSc really give speedup?
Problem Detail: I searched linear solver library and found out PETSc library which considered to be powerful and useful library. PETSc consists implementations of various iterative methods with preconditioners and sparse matrix storing methods. All methods are realized sequentially and in Read More …
[Solved]: What’s the difference between a stream and a queue?
Problem Detail: What’s the difference between a stream and a queue? They both have the concept of an ordered set of elements, but tend to have different implementations and a different vocabulary of ‘insert’/’extract’ (streams) vs. ‘enqueue’/’dequeue’ (queue). Are these interchangable? Read More …
[Solved]: Finding a 5-Pointed Star in polynomial time
Problem Detail: I want to establish that this is part of my homework for a course I am currently taking. I am looking for some assistance in proceeding, NOT AN ANSWER. This is the question in question: A 5-pointed-star in an Read More …
