Sudoku, S-permutation matrices and bipartite graphs

The book examines some combinatorial problems related to the number of Sudoku matrices. The problem is reduced to the task of finding the number of mutually disjoint pairs of S-permutation matrices. We describe some algorithms that solve this problem. Essential role in the description of the corresponding formulas and algorithms play bipartite graphs and operations with binary matrices. Solving the main problem, we have discussed also other mathematical and algorithmic problems, which in itself are interesting.

Info autore

South-West University, Faculty of Mathematics and Natural Sciences, Blagoevgrad, Bulgaria, D.Sc. thesis: "Bitwise operations and combinatorial algorithms with binary matrices, sets and graphs", PhD thesis: "Semigroup representation of context-free languages".

Dettagli sul prodotto

• Autori: Krasimir Yordzhev
• Editore: LAP Lambert Academic Publishing
• Lingue: Inglese, Tedesco
• Formato: Tascabile
• Pubblicazione: 26.10.2016
• EAN: 9783659974724
• ISBN: 978-3-659-97472-4
• Pagine: 104
• Categoria: Scienze naturali, medicina, informatica, tecnica > Matematica