{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:18:00Z","timestamp":1778084280152,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0020-0190(92)90156-p","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"301-306","source":"Crossref","is-referenced-by-count":9,"title":["Linear congruence equations for the solutions of the N-Queens problem"],"prefix":"10.1016","volume":"41","author":[{"given":"Cengiz","family":"Erbas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murat M.","family":"Tanik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zekeriya","family":"Aliyazicioglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90156-P_BIB1","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/0743-7315(89)90011-7","article-title":"Divide and conquer under global constraints: A solution to the n-queens problem","volume":"6","author":"Abramson","year":"1989","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0020-0190(92)90156-P_BIB2","volume":"Vol. 1","author":"Ahrens","year":"1921"},{"key":"10.1016\/0020-0190(92)90156-P_BIB3","first-page":"105","volume":"6. Band","author":"Gauss","year":"1865"},{"key":"10.1016\/0020-0190(92)90156-P_BIB4","doi-asserted-by":"crossref","first-page":"725","DOI":"10.2307\/2323225","article-title":"A combinatorial theorem on circulant matrices","author":"Clark","year":"1985","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0020-0190(92)90156-P_BIB5","article-title":"Different perspectives of the N-Queens problem","author":"Erbas","year":"1992","journal-title":"Proc. ACM 1992 Computer Science Conf."},{"key":"10.1016\/0020-0190(92)90156-P_BIB6","article-title":"Storage schemes for parallel memory systems and the N-Queens problem","author":"Erbas","year":"1992","journal-title":"Proc. 15th Ann. ASME ETCE Conf., Computer Applications Symp."},{"key":"10.1016\/0020-0190(92)90156-P_BIB7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(86)90128-6","article-title":"A note on the queens' problem","volume":"23","author":"Falkowski","year":"1986","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/0020-0190(92)90156-P_BIB8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.2307\/2689591","article-title":"An application of graph theory and integer programming: Chessboard non-attacking puzzles","volume":"57","author":"Foulds","year":"1984","journal-title":"Math. Mag."},{"key":"10.1016\/0020-0190(92)90156-P_BIB9","first-page":"63","article-title":"Gauss's arithmetization of the problem of 8 queens","volume":"5","author":"Ginsburg","year":"1939","journal-title":"Scripta Math."},{"issue":"4","key":"10.1016\/0020-0190(92)90156-P_BIB10","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1145\/321296.321300","article-title":"Backtrack programming","volume":"12","author":"Golomb","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(92)90156-P_BIB11","first-page":"281","article-title":"Zur mathematischen Theorie des Schachbretts","volume":"56","author":"Gunther","year":"1874","journal-title":"Arch. Math. Physik"},{"key":"10.1016\/0020-0190(92)90156-P_BIB12","doi-asserted-by":"crossref","first-page":"66","DOI":"10.2307\/2689192","article-title":"Constructions for the m queens problem","author":"Hoffman","year":"1969","journal-title":"Math. Mag."},{"key":"10.1016\/0020-0190(92)90156-P_BIB13","author":"Lucas","year":"1891","journal-title":"R\u00e9cr\u00e9ations Math\u00e9matiques"},{"key":"10.1016\/0020-0190(92)90156-P_BIB14","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01932307","article-title":"An experiment on program development","volume":"12","author":"Naur","year":"1971","journal-title":"BIT"},{"key":"10.1016\/0020-0190(92)90156-P_BIB15","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/64.54670","article-title":"Representation selection for constraint satisfaction: A case study using n-queens","author":"Nadel","year":"1990","journal-title":"IEEE Expert"},{"key":"10.1016\/0020-0190(92)90156-P_BIB16","first-page":"364","article-title":"\u00dcber die \u201cdoppelt-periodischen\u201d L\u00f6sungen des n-Damen-Problems","author":"Polya","year":"1918","journal-title":"Mathematische Unterhaltungen und Spiele"},{"key":"10.1016\/0020-0190(92)90156-P_BIB17","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0020-0190(87)90171-2","article-title":"A simplified solution of the n queens' problem","volume":"25","author":"Reichling","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90156-P_BIB18","first-page":"284","article-title":"An algebraic approach to constraint satisfaction problems","volume":"Vol. 1","author":"Rivin","year":"1989","journal-title":"Proc. Internat. Conf. on Artificial Intelligence (IJCAI-89)"},{"key":"10.1016\/0020-0190(92)90156-P_BIB19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0020-0190(83)90104-7","article-title":"A faster lexicographical n-queens algorithm","volume":"17","author":"Rohl","year":"1983","journal-title":"Inform. Process. Lett."},{"issue":"9","key":"10.1016\/0020-0190(92)90156-P_BIB20","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1109\/32.58788","article-title":"KIDS: A semiautomatic program development system","volume":"16","author":"Smith","year":"1990","journal-title":"IEEE Trans. Software Eng."},{"issue":"3","key":"10.1016\/0020-0190(92)90156-P_BIB21","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/101340.101343","article-title":"A polynomial time algorithm for the n-queens problem","volume":"1","author":"Sosic","year":"1990","journal-title":"SIGART"},{"issue":"4","key":"10.1016\/0020-0190(92)90156-P_BIB22","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1147\/rd.314.0464","article-title":"Efficient search techniques \u2013 An empirical study of the n-queens problem","volume":"31","author":"Stone","year":"1987","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0020-0190(92)90156-P_BIB23","series-title":"Ph.D. Dissertation","article-title":"A graph model for deadlock prevention","author":"Tanik","year":"1978"},{"issue":"4","key":"10.1016\/0020-0190(92)90156-P_BIB24","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/362575.362577","article-title":"Program development by stepwise refinement","volume":"14","author":"Wirth","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(92)90156-P_BIB25","series-title":"Challenging Mathematical Problems with Elementary Solutions","first-page":"92","author":"Yaglom","year":"1964"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290156P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290156P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:26:57Z","timestamp":1555144017000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290156P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["002001909290156P"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90156-p","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}