{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:39:21Z","timestamp":1649191161417},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,6]]},"abstract":"<jats:p> This work examines the problem to describe an efficient algorithm for obtaining [Formula: see text] Sudoku matrices. For this purpose, we define the concepts of [Formula: see text] [Formula: see text]-matrix and disjoint [Formula: see text]-matrices. The paper, using the set-theoretical approach, describes an algorithm for obtaining [Formula: see text]-tuples of [Formula: see text] mutually disjoint [Formula: see text] matrices. We show that in input [Formula: see text] mutually disjoint [Formula: see text] matrices, it is not difficult to receive a Sudoku matrix. <\/jats:p>","DOI":"10.1142\/s1793830917500380","type":"journal-article","created":{"date-parts":[[2017,4,25]],"date-time":"2017-04-25T06:15:32Z","timestamp":1493100932000},"page":"1750038","source":"Crossref","is-referenced-by-count":0,"title":["On an algorithm for receiving Sudoku matrices"],"prefix":"10.1142","volume":"09","author":[{"given":"Krasimir","family":"Yordzhev","sequence":"first","affiliation":[{"name":"Faculty of Mathematics and Natural Sciences, South-West University, Ivan Mihaylov 66, Blagoevgrad, 2700, Bulgaria"}]}],"member":"219","published-online":{"date-parts":[[2017,4,25]]},"reference":[{"key":"S1793830917500380BIB001","volume-title":"Object-Oriented Programming: Data Structures and STL","author":"Azalov P.","year":"2008"},{"key":"S1793830917500380BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2008.12.023"},{"key":"S1793830917500380BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-0004-9"},{"key":"S1793830917500380BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-0261-2"},{"key":"S1793830917500380BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830916500269"},{"key":"S1793830917500380BIB007","volume-title":"Java: The Complete Reference","author":"Sghildt H.","year":"2014","edition":"9"},{"key":"S1793830917500380BIB008","volume-title":"Symbolic C++: An Introduction to Computer Algebra Using Object-Oriented Programming","author":"Tan K. S.","year":"2000"},{"key":"S1793830917500380BIB009","volume-title":"Data Structures and Programming in C++","author":"Todorova M.","year":"2011"},{"key":"S1793830917500380BIB010","first-page":"291","volume":"6","author":"Yordzhev K.","year":"2012","journal-title":"Internat. J. Math. Sci. Eng. Appl."},{"key":"S1793830917500380BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.06.054"},{"key":"S1793830917500380BIB012","first-page":"24","volume":"10","author":"Yordzhev K.","year":"2011","journal-title":"Infor. Technol. Edu."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500380","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T15:46:09Z","timestamp":1565106369000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,25]]},"references-count":11,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2017,2,24]]},"published-print":{"date-parts":[[2017,6]]}},"alternative-id":["10.1142\/S1793830917500380"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500380","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,25]]}}}