Pages that link to "Item:Q4611086"
From MaRDI portal
The following pages link to Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers (Q4611086):
Displaying 11 items.
- Classifying partial Latin rectangles (Q324368) (← links)
- Using a CAS/DGS to analyze computationally the configuration of planar bar linkage mechanisms based on partial Latin squares (Q782688) (← links)
- Estimating the number of Latin rectangles by the fast simulation method (Q1040349) (← links)
- Enumeration of Latin arrays. II: Case \(n=4\), \(k\leq 4\) (Q1177968) (← links)
- A census of critical sets based on non-trivial autotopisms of Latin squares of order up to five (Q2131453) (← links)
- Enumerating partial Latin rectangles (Q2188838) (← links)
- Refining invariants for computing autotopism groups of partial Latin rectangles (Q2305926) (← links)
- A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares (Q2326748) (← links)
- A historical perspective of the theory of isotopisms (Q2333645) (← links)
- Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method (Q2346593) (← links)
- Automatic counting of generalized Latin rectangles and trapezoids (Q6097992) (← links)
