IgnouGroup Social Campus
Problem Detail: This question is motivated by an older question about tiling an orthogonal polygon with squares. It is a generalisation of my former question about how to prove that the minimum square partition of a 3X2 rectangle has 3 squares). Read More …
Problem Detail: The answers to this question on Crypto Stack Exchange basically says that, to measure the complexity of the logarithm problem, we have to take the length of the number representing the size of the group into account. It seems Read More …
Problem Detail: I know that for executing a program, it should be copied to RAM. But the problem is whole of it may not be copied always. Since the size of the RAM is limited, there is mechanism called virtual memory. Read More …
Problem Detail: If I’m correct, some boolean formulas in CNF require exponential size when being converted to an equivalent DNF version (and vice versa). But what is an example of such a formula (and is there a general way to capture Read More …
Problem Detail: I’m having trouble finding materials on what ‘finger search’ is, in the context of a red black tree. Even Wikipedia has a very short page about that, could you refer me or explain what kind of search is that. Read More …
Problem Detail: Suppose that I have a set of $N$ points in $k$-dimensional space ($k>1$), such as in this question, and that I need to find all pairs with a distance¹ smaller than a certain threshold $t$. The brute-force method would Read More …
Problem Detail: Is it possible to have a decision problem $A$ which belongs to P and reduce it to a decision problem $B$ which belongs to NP, i.e. $A leq_{mathrm{p}} B$, where $A$ belongs to P, $B$ belongs to NP? Asked Read More …
Problem Detail: (For reference, i am using Kevin P Murphy’s Book “Machine Learning: A Probabilistic Perspective” and implementing with MATLAN – without any toolboxes) I have a dataset with 392 samples (rows), each sample has 8 features (columns), one of which Read More …
Problem Detail: As a fun project, I’ve been working on a C# implementation of Richard Korf’s – Finding Optimal Solutions to Rubik’s Cube Using Pattern Databases. https://www.cs.princeton.edu/courses/archive/fall06/cos402/papers/korfrubik.pdf I actually have it working, I’m just trying to improve my solution. One thing Read More …
Problem Detail: I’m trying to use gates that do addition and multiplication modulo 5 to emulate logic gates. Assuming false and true are mapped to 0 and 1 respectively (with 2, 3, and 4 being invalid), I figured out I can Read More …
