IgnouGroup Social Campus
Problem Detail: How can you perform the clique decision algorithm fewer than $ O(n) $ times to solve clique optimization? I’m not sure if my approach is right but this is my thought process: you would pick vertices in a graph Read More …
Problem Detail: I have seen examples about Banker’s Algorithm from this Wikipedia link, this book and many other places. In all these examples some processes are allocated resources less than their Max Need. For example, consider the state of system as Read More …
Problem Detail: I stumbled across this question and answer (source): Question: Suppose someone presents you with a solution to a max-flow problem on some network. Give a linear time algorithm to determine whether the solution does indeed give a maximum flow. Read More …
Problem Detail: I know that device drivers are attached to device controllers, which have their own registers and some local buffer storage. I’m wondering if I can think of device drivers as little state machines — i.e. do they read and Read More …
Problem Detail: I’m trying to solve the following optimization problem. A is a rectangular matrix with coefficients in the finite field Z/2Z (size less than 1000 X 1000). I have a system of the form A.X = Y (X and Y Read More …
Problem Detail: Since, I don’t have strong algorithmic background my question may sound a litlle odd. Please correct me, if so. I have quite a large bitmap (~100 Million bits) (e.g. 100100101001010001001…010010). The bitmap is just an example, it doesn’t have Read More …
Problem Detail: I’m trying to analyze an algorithm of a function, I can express the function in term of summation, but I have no clues on how I could simplify this summation down to get the run-time in tern of big Read More …
Problem Detail: I am trying to get a big picture on the importance of least fixed point (lfp) in program analysis. For instance abstract interpretation seems to use the existence of lfp. Many research papers on program analysis also focus heavily Read More …
Problem Detail: So, let’s say we have two languages $L$ (which is any context-free language) and $M$ which is the basic CFL ${0^n1^n: ngeq 0}$. Can $L le_p M$ ? Why or why not? How do polynomial time reductions even work Read More …
Problem Detail: I have to be able to perform insert, delete, range-value-sum, and range-2-max-values with a data structure. Range-value-sum(xl,xr): with a range [xl,xr] (for a range query), it reports the sum of values of all elements whose keys are in the Read More …
