Author: ignougroup

Problem Detail: Suppose I am given $n$ fixed width integers (i.e. they fit in a register of width $w$), $a_1, a_2, dots a_n$ such that their sum $a_1 + a_2 + dots + a_n = S$ also fits in a register Read More …

Problem Detail: It seems to me that the per-record timeline consistency as defined by Cooper et al. in “PNUTS: Yahoo!’s Hosted Data Serving Platform” mimics the (older?) definition of monotonic writes. From the paper: per-record timeline consistency: all replicas of a Read More …

Problem Detail: There is a network with $n$ nodes. Each node can contact only the neighbouring nodes (the degree of each node is bounded, if that matters). One of the nodes, say $s$, wants to know $n$. How can it do Read More …

Problem Detail: I’m looking for resources on getting started with program analysis. The only book I’ve found on the topic is the Nielson & Nielson book. Other than that, it seems like there are only “compiler” books where “program analysis” would Read More …

Problem Detail: Minimum bandwidth problem is to a find an ordering of graph nodes on integer line that minimizes the largest distance between any two adjacent nodes. The decision problem is NP-complete even for binary trees. Complexity Results for Bandwidth Minimization. Read More …

Problem Detail: A non-erasing Turing machine is one that cannot replace a symbol with a blank unless the symbol under the read head is a blank. I’m trying to understand whether there is loss of generality because of this restriction. My Read More …

Problem Detail: in order to solve a DARP problem I created a Python class, that can generate random graphs. I attribute a random number to every edge which represents the cost to travel over that edge. My current solution for connecting Read More …

Problem Detail: this is my first question on this site. I‌ recently, study on NP. I have some confusion about this Topic, and want to propose my inference and some one verify me. I) each NP problem can be solved in Read More …

Problem Detail: I asked this question in SO here I have about 1000 sets of size <=5 containing numbers 1 to 100. {1}, {4}, {1,3}, {3,5,6}, {4,5,6,7}, {5,25,42,67,100} … Is it possible to find a set of size 20 that contains Read More …