Pages that link to "Item:Q1426113"
From MaRDI portal
The following pages link to On the hardness of counting problems of complete mappings. (Q1426113):
Displaying 8 items.
- A survey of known results and research areas for \(n\)-queens (Q998490) (← links)
- Estimating the number of good permutations by a modified fast simulation method (Q1008305) (← links)
- Upper bound on the number of complete maps (Q1364111) (← links)
- Calculation of the number of complete mappings for permutations (Q1592100) (← links)
- Additive triples of bijections, or the toroidal semiqueens problem (Q1725577) (← links)
- An easy counting lemma (Q1730233) (← links)
- Planar polynomials for commutative semifields with specified nuclei (Q2384049) (← links)
- (Q5150655) (← links)