On the number of Sudoku squares
From MaRDI portal
Publication:1783641
DOI10.1016/J.DISC.2018.08.005zbMath1395.05010OpenAlexW2890212064WikidataQ60692163 ScholiaQ60692163MaRDI QIDQ1783641
Publication date: 21 September 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.08.005
Related Items (3)
A sublinear Sudoku solution in cP systems and its formal verification ⋮ Counting Star-Battle configurations ⋮ Enumerating extensions of mutually orthogonal Latin squares
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges
- An upper bound on the number of high-dimensional permutations
- The many formulae for the number of Latin rectangles
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum
- An upper bound for the permanent of \((0,1)\)-matrices.
- On the number of Latin squares
- Groups of orthogonal row-latin squares
- There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
- Some upper bounds for permanents of (0, 1)-matrices
- A note on some upper bounds for permanents of (0, 1)-matrices
- Asymptotic enumeration of Latin rectangles
- Asymptotic enumeration of Latin rectangles
This page was built for publication: On the number of Sudoku squares