Pages that link to "Item:Q1014505"
From MaRDI portal
The following pages link to Permutation matrices related to Sudoku (Q1014505):
Displaying 17 items.
- Sudoku-like arrays, codes and orthogonality (Q510424) (← links)
- Calculation of the number of all pairs of disjoint S-permutation matrices (Q670673) (← links)
- Fractions of permutations. An application to Sudoku (Q719456) (← links)
- Sudoku associative memory (Q889294) (← links)
- Set selection dynamical system neural networks with partial memories, with applications to Sudoku and KenKen puzzles (Q1669134) (← links)
- Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer (Q1679226) (← links)
- Bipartite graphs related to mutually disjoint \(S\)-permutation matrices (Q1935979) (← links)
- Combining Hopfield neural networks, with applications to grid-based mathematics puzzles (Q2185623) (← links)
- On the number of mutually disjoint pairs of \(S\)-permutation matrices (Q2400583) (← links)
- On the cardinality of a factor set of binary matrices (Q2406405) (← links)
- On the number of disjoint pairs of S-permutation matrices (Q2446899) (← links)
- On the probability of two randomly generated \(S\)-permutation matrices to be disjoint (Q2453992) (← links)
- Random Latin squares and Sudoku designs generation (Q2509804) (← links)
- A new algorithm for enumerating all possible Sudoku squares (Q3178156) (← links)
- Latin Squares and their Bruhat Order (Q3303521) (← links)
- (Q4500618) (← links)
- On an algorithm for receiving Sudoku matrices (Q5367532) (← links)
