Abstract:Derangement is one well-known problem in the filed of probability theory. An in- stance of a derangement problem contains a finite collection C of n paired objects, C = {(x1 , y1 ), ..., (xn , yn )}. The derangement problem asks how many ways to gener- ate a new collection C′ ̸= C such that for each (xi,yj) ∈ C′,i ̸= j. We propose an efficient dynamic programming algorithm that divides an instance of the derangement problem into several subproblems. During a recursive process of unrolling a subproblem, there e… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.