IgnouGroup Social Campus
Problem Detail: Karlheinz Brandenburg depicts a MP3 encoder like this: Source: MP3 and AAC Explained I marked the FFT as I’m not quite sure why it is actually necessary to perform one. Why can’t the psychoacoustic model be applyed to the Read More …
Problem Detail: I have an optimization problem in which I need to sum pixel values in an image over a rectangular region. This is a core component of the optimization so it will be done often and the naive solution is Read More …
Problem Detail: I need to find a Hamiltonian cycle in a directed graph using propositional logic, and to solve it by sat solver. So after I couldn’t find a working solution, I found a paper that describes how to construct a Read More …
Problem Detail: I have a problem with the application of the Shannon expansion for to obtain the negation of a formula boolean, than will need for implement the negation operator on OBDD (Order Binary Decision Diagram) that is, show that: $qquad Read More …
Problem Detail: I am new to this forum and just a physicist who does this to keep his brain in shape, so please show grace if I do not use the most elegant language. Also please leave a comment, if you Read More …
Problem Detail: Introduction to Algorithms said that quicksort “works well even in virtual-memory environments,” but didn’t explain why. I’ve tried looking an Wikipedia and Stack Exchange, but found no reason why. Is it just because quicksort sorts in place? Asked By Read More …
Problem Detail: If CFL are not closed under complementation, it means that if a language ‘$L$’ is CFL then its compliment $L^C$ is not CFL. Then how can we discuss about $L^C$ being recursive? My doubt arose because I think if Read More …
Problem Detail: I am considering the following heuristic for the graph coloring problem (i.e. to color a graph $G$ using a minimal number of colors so that no two adjacent vertices have the same color): Explore the vertices of $G$ in Read More …
Problem Detail: I am currently studying probabilistic algorithms and came across three major complexity classes: BPP: worst-case polynomial time, two-sided error RP: worst-case polynomial time, one-sided error ZPP: average-case polynomial time, no error At first I couldn’t understand why one would Read More …
Problem Detail: I am trying to understand the proof of the Karp-Lipton theorem as stated in the book “Computational Complexity: A modern approach” (2009). In particular, this book states the following: Karp-Lipton theorem If NP $subseteq$ $P_{backslash poly}$, then PH $= Read More …
