{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:54:22Z","timestamp":1725814462639},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319137698"},{"type":"electronic","value":"9783319137704"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13770-4_9","type":"book-chapter","created":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T08:36:05Z","timestamp":1418027765000},"page":"88-98","source":"Crossref","is-referenced-by-count":0,"title":["A Mathematical Hierarchy of Sudoku Puzzles and Its Computation by Boolean Gr\u00f6bner Bases"],"prefix":"10.1007","author":[{"given":"Shutaro","family":"Inoue","sequence":"first","affiliation":[]},{"given":"Yosuke","family":"Sato","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Chang, C., Fan, Z., Sun, Y.: Hsolve: A Difficulty Metric and Puzzle Generator for Sudoku (2008), \n                    \n                      http:\/\/web.mit.edu\/yisun\/www\/papers\/sudoku.pdf"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/11870814_13","volume-title":"Computer Algebra in Scientific Computing","author":"J. Gago-Vargas","year":"2006","unstructured":"Gago-Vargas, J., Hartillo-Hermoso, I., Mart\u00edn-Morales, J., Ucha-Enr\u00edquez, J.M.: Sudokus and Gr\u00f6bner Bases: Not Only a Divertimento. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2006. LNCS, vol.\u00a04194, pp. 155\u2013165. Springer, Heidelberg (2006)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-04103-7_13","volume-title":"Computer Algebra in Scientific Computing","author":"S. Inoue","year":"2009","unstructured":"Inoue, S.: On the Computation of Comprehensive Boolean Gr\u00f6bner Bases. In: Gerdt, V.P., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2009. LNCS, vol.\u00a05743, pp. 130\u2013141. Springer, Heidelberg (2009)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-662-44199-2_80","volume-title":"Mathematical Software \u2013 ICMS 2014","author":"A. Nagai","year":"2014","unstructured":"Nagai, A., Inoue, S.: An Implementation Method of Boolean Gr\u00f6bner Bases and Comprehensive Boolean Gr\u00f6bner Bases on General Computer Algebra Systems. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol.\u00a08592, pp. 531\u2013536. Springer, Heidelberg (2014)"},{"key":"9_CR5","unstructured":"Challenge your brain: is this the world\u2019s hardest Sudoku?, \n                    \n                      http:\/\/www.efamol.com\/efamol-news\/news-item.php?id=10"},{"key":"9_CR6","unstructured":"Introducing the World\u2019s Hardest Sudoku, \n                    \n                      http:\/\/www.efamol.com\/efamol-news\/news-item.php?id=43"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-15976-2_17","volume-title":"Rewriting Techniques and Applications","author":"A. Kandri-Rody","year":"1985","unstructured":"Kandri-Rody, A., Kapur, D., Narendran, P.: An Ideal-Theoretic Approach for Word Problems and Unification Problems over Commutative Algebras. In: Jouannaud, J.-P. (ed.) RTA 1985. LNCS, vol.\u00a0202, pp. 345\u2013364. Springer, Heidelberg (1985)"},{"key":"9_CR8","unstructured":"Noro, M., et al.: A Computer Algebra System Risa\/Asir (2014), \n                    \n                      http:\/\/www.math.kobe-u.ac.jp\/Asir\/asir.html"},{"key":"9_CR9","volume-title":"Boolean functions and equations","author":"S. Rudeanu","year":"1974","unstructured":"Rudeanu, S.: Boolean functions and equations. North-Holland Publishing Co., American Elsevier Publishing Co., Inc., Amsterdam-London, New York (1974)"},{"issue":"5","key":"9_CR10","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.jsc.2010.10.011","volume":"46","author":"Y. Sato","year":"2011","unstructured":"Sato, Y., et al.: Boolean Gr\u00f6bner bases. Journal of Symbolic Computation\u00a046(5), 622\u2013632 (2011)","journal-title":"Journal of Symbolic Computation"},{"key":"9_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-87827-8_29","volume-title":"Computer Mathematics","author":"Y. Sato","year":"2008","unstructured":"Sato, Y., Nagai, A., Inoue, S.: On the Computation of Elimination Ideals of Boolean Polynomial Rings. In: Kapur, D. (ed.) ASCM 2007. LNCS (LNAI), vol.\u00a05081, pp. 334\u2013348. Springer, Heidelberg (2008)"},{"key":"9_CR12","unstructured":"Gohnai, K.: Cross Word editorial desk (2008). Number Placement Puzzles (Basic, Middle, High, SuperHigh, Hard, SuperHard, UltraHard). Kosaido Publishing Co. (2008) (in Japanese)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Symbolic Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13770-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:42:07Z","timestamp":1559072527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13770-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319137698","9783319137704"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13770-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}