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’m trying to write a regular expression for some particular license plates. They consist of one up to three capital letters, a hyphen, one up to two capitol letters and one up to four numbers. The license plate should Read More …
Problem Detail: Suppose I have a set $A$ of elements in ${1, ldots, n}$, given as an unordered list. I would like to compute the complement of $A$, i.e., I would like to produce an unordered list of entries in ${1, Read More …
Problem Detail: I’m just confused, cause from my knowledge recurrence is applied mostly to recursive procedures or divide and conquer techniques etc. Asked By : Sameer Thigale Answered By : David Richerby Sure. The cost of searching a list of length zero is Read More …
Problem Detail: My understanding is that Karp many-one reductions are more general than Levin many-one reductions, and that Levin many-one reductions must allow for the number of certificates for a problem $A$ reduced to $B$ to be recovered from a single Read More …
Problem Detail: For the undecidable languages I have seen so far , I am able to give a reduction from one language to other . Is it the case that every undecidable language is reducible to every other undecidable language? If 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’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: 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 …
