Pages that link to "Item:Q1398582"
From MaRDI portal
The following pages link to An algorithm for calculation of the number of \(m\)-permutations of multisets (Q1398582):
Displaying 8 items.
- The \(r\)-multipermutations (Q1331143) (← links)
- A loopless algorithm for generating the permutations of a multiset (Q1885026) (← links)
- An algebraic approach for the search space of permutations with repetition (Q2057112) (← links)
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
- Efficient methods of calculating the number of heapable permutations (Q2691575) (← links)
- On the number of combinations on multisets (Q2737042) (← links)
- Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations (Q2876591) (← links)
- (Q4633912) (← links)