{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:13:57Z","timestamp":1759666437077},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215803"},{"type":"electronic","value":"9783642215810"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21581-0_9","type":"book-chapter","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T13:30:19Z","timestamp":1307712619000},"page":"90-104","source":"Crossref","is-referenced-by-count":12,"title":["\u03c0DD: A New Decision Diagram for Efficient Problem Solving in Permutation Space"],"prefix":"10.1007","author":[{"given":"Shin-ichi","family":"Minato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"9_CR1","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"9_CR2","series-title":"LNCS(LNAI)","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/10721959_35","volume-title":"Automated Deduction - CADE-17","author":"P. Chatalic","year":"2000","unstructured":"Chatalic, P., Simon, L.: Zres: The old davis-putnam procedure meets ZBDDs. In: McAllester, D. (ed.) CADE 2000. LNCS(LNAI), vol.\u00a01831, pp. 449\u2013454. Springer, Heidelberg (2000)"},{"key":"9_CR3","unstructured":"GAP Forum. GAP \u2013 Groups, Algorithms, Programming \u2013 a System for Computational Discrete Algebra (2008), \n                      \n                        http:\/\/www.gap-system.org\/"},{"key":"9_CR4","series-title":"The Art of Computer Programming","first-page":"11","volume-title":"Combinatorial properties of permutations","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: Combinatorial properties of permutations. The Art of Computer Programming, vol.\u00a03, ch. 5.1, pp. 11\u201372. Addison-Wesley, Reading (1998)"},{"key":"9_CR5","series-title":"fascicle 1","volume-title":"The Art of Computer Programming: Bitwise Tricks & Techniques; Binary Decision Diagrams","author":"D.E. Knuth","year":"2009","unstructured":"Knuth, D.E.: The Art of Computer Programming: Bitwise Tricks & Techniques; Binary Decision Diagrams. fascicle 1, vol.\u00a04. Addison-Wesley, Reading (2009)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proc. of 30th ACM\/IEEE Design Automation Conference, pp. 272\u2013277 (1993)","DOI":"10.1145\/157485.164890"},{"key":"9_CR7","unstructured":"Rokicki, T., Kociemba, H., Davidson, M., Dethridge, J.: God\u2019s number is 20 (2010), \n                      \n                        http:\/\/www.cube20.org\/"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21581-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T15:07:22Z","timestamp":1553785642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21581-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215803","9783642215810"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21581-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}