Pages that link to "Item:Q4221860"
From MaRDI portal
The following pages link to Generating uniformly distributed random latin squares (Q4221860):
Displaying 43 items.
- Constructing flag-transitive, point-imprimitive designs (Q295818) (← links)
- Computing the autotopy group of a Latin square by cycle structure (Q397148) (← links)
- Markov degree of the Birkhoff model (Q402946) (← links)
- Switching in one-factorisations of complete graphs (Q405262) (← links)
- Pasch trades with a negative block (Q409349) (← links)
- Multicanonical MCMC for sampling rare events: an illustrative review (Q457273) (← links)
- Random Latin squares and 2-dimensional expanders (Q488979) (← links)
- Switching codes and designs (Q658111) (← links)
- The cycle switching graph of the Steiner triple systems of order 19 is connected (Q659722) (← links)
- The Sudoku completion problem with rectangular hole pattern is NP-complete (Q713152) (← links)
- The impact of search heuristics on heavy-tailed behaviour (Q850467) (← links)
- Designs on the web (Q856844) (← links)
- On the number of transversals in Cayley tables of cyclic groups (Q968119) (← links)
- A generalisation of \(t\)-designs (Q1044956) (← links)
- Most Latin squares have many subsquares (Q1291124) (← links)
- Mappings of Latin squares (Q1362666) (← links)
- Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer (Q1679226) (← links)
- Research problems from the 18th British Combinatorial Conference (Q1810663) (← links)
- Strong polynomial completeness of almost all quasigroups (Q2113390) (← links)
- Generation of proper families of functions (Q2172878) (← links)
- Efficient verification of polynomial completeness of quasigroups (Q2206949) (← links)
- Efficient, local and symmetric Markov chains that generate one-factorizations (Q2216928) (← links)
- Refining invariants for computing autotopism groups of partial Latin rectangles (Q2305926) (← links)
- Half-regular factorizations of the complete bipartite graph (Q2399287) (← links)
- Symmetries of partial Latin squares (Q2509698) (← links)
- Random Latin squares and Sudoku designs generation (Q2509804) (← links)
- A Markov chain on the solution space of edge colorings of bipartite graphs (Q2696608) (← links)
- Completions of \(\epsilon \)-dense partial Latin squares (Q2864800) (← links)
- On uniformly generating Latin squares (Q2908697) (← links)
- Generating Uniformly Distributed Random 2-Designs with Block Size 3 (Q3167102) (← links)
- The Glauber dynamics for edge‐colorings of trees (Q3386527) (← links)
- The cycle structure of two rows in a random Latin square (Q3608297) (← links)
- Uniform generation of random Latin rectangles (Q3983255) (← links)
- Monotone Subsequences in High-Dimensional Permutations (Q4601054) (← links)
- A Novel Quasigroup Substitution Scheme for Chaos Based Image Encryption (Q4626927) (← links)
- Sudoku Latin Square Sampling for Markov Chain Simulation (Q5117929) (← links)
- Random strongly regular graphs? (Q5899351) (← links)
- Random strongly regular graphs? (Q5907044) (← links)
- Substructures in Latin squares (Q6050265) (← links)
- Sequential importance sampling for estimating expectations over the space of perfect matchings (Q6103989) (← links)
- Large deviations in random latin squares (Q6133414) (← links)
- Computing random \(r\)-orthogonal Latin squares (Q6606227) (← links)
- Constructing random Steiner triple systems: an experimental study (Q6613365) (← links)
