{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:42:10Z","timestamp":1747546930169},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540510833"},{"type":"electronic","value":"9783540461524"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51083-4_51","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:42:08Z","timestamp":1330184528000},"page":"99-110","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Backtrack searching in the presence of symmetry"],"prefix":"10.1007","author":[{"given":"Cynthia A.","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry","family":"Finkelstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Paul Walton","family":"Purdom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/361219.361224","volume":"18","author":"J. R. Bitner","year":"1975","unstructured":"James R. Bitner and Edward M. Reingold, \u201cBacktrack Programming Techniques\u201d, CACM\n18 (1975), pp. 121\u2013136.","journal-title":"CACM"},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1137\/0205041","volume":"5","author":"R. W. Brockett","year":"1976","unstructured":"Roger W. Brockett and David Dobkin, \u201cOn the Number of Multiplications Required for Matrix Multiplication\u201d, SIAM J. Comput.\n5 (1976), pp. 624\u2013628.","journal-title":"SIAM J. Comput."},{"key":"9_CR3","unstructured":"C. A. Brown, L. A. Finkelstein, and P. W. Purdom, Jr., \u201cBacktrack Searching in the Presence of Symmetry\u201d, NUTR NU-CCS-87-2 (1987)."},{"key":"9_CR4","unstructured":"C. A. Brown, L. A. Finkelstein, and P. W. Purdom, Jr., \u201cEfficient Implementation of Jerrum's Algorithm for Permutation Groups\u201d, NUTR NU-CCS-87-19 (1987)."},{"key":"9_CR5","unstructured":"C. A. Brown, L. A. Finkelstein, and P. W. Purdom, Jr., \u201cA New Base Change Algorithm for Permutation Groups\u201d, NUTR NU-CCS-87-30 (1987)."},{"key":"9_CR6","first-page":"671","volume":"39","author":"G. Butler","year":"1982","unstructured":"G. Butler, \u201cComputing in Permutation and Matrix Groups II: Backtrack Algorithm\u201d, Math. Comp.\n39 (1982), pp. 671\u2013680.","journal-title":"Math. Comp."},{"key":"9_CR7","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0747-7171(85)80021-3","volume":"1","author":"G. Butler","year":"1985","unstructured":"G. Butler and C. W. H. Lam, \u201cA General Backtrack Algorithm for the Isomorphism Problem of Combinatorial Objects\u201d, Journal of Symbolic Computation\n1 (1985), pp. 363\u2013382.","journal-title":"Journal of Symbolic Computation"},{"key":"9_CR8","unstructured":"J. J. Cannon, \u201cAn Introduction to the Group Theory Language, Cayley\u201d, in Computational Group Theory, edited by M. D. Atkinson, Academic Press, 1984, pp. 145\u2013184."},{"key":"9_CR9","unstructured":"J. L. Carter, On the Existence of a Projective Plane of Order 10, Ph. D. Thesis, University of California at Berkeley (1974)."},{"issue":"4","key":"9_CR10","first-page":"457","volume":"48","author":"J. W. L. Glaisher","year":"1874","unstructured":"J. W. L. Glaisher, \u201cOn the Problem of the Eight Queens\u201d, Philosophical Magazine series 4, vol. 48 (1874), pp. 457\u2013467.","journal-title":"Philosophical Magazine"},{"key":"9_CR11","unstructured":"Shafi Goldwasser and Michael Sipser, \u201cPrivate Coins versus Public Coins in Interactive Proof Systems\u201d, Proc. 18th Sym. on Theory of Computing (1986) pp. 59\u201368."},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1137\/0202013","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"J. Hopcroft and J. Musinski, \u201cDuality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms\u201d, SIAM J. Comput.\n2 (1973), pp. 159\u2013173.","journal-title":"SIAM J. Comput."},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/0196-6774(86)90038-6","volume":"7","author":"M. Jerrum","year":"1986","unstructured":"Mark Jerrum, \u201cA Compact Representation for Permutation Groups\u201d, Journal of Algorithms\n7 (1986), pp. 60\u201378.","journal-title":"Journal of Algorithms"},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1137\/0215043","volume":"15","author":"R. W. Johnson","year":"1986","unstructured":"Rodney W. Johnson and Aileen M. Mc Loughlin, \u201cNoncommutative Bilinear Algorithms for 3 \u00d7 3 Matrix Multiplication\u201d, SIAM J. Comput.\n15 (1986), pp. 595\u2013603.","journal-title":"SIAM J. Comput."},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1090\/S0002-9904-1976-13988-2","volume":"82","author":"J. D. Laderman","year":"1976","unstructured":"Julian D. Laderman, \u201cA Noncommutative Algorithm for Multiplying 3 \u00d7 3 Matrices Using 23 Multiplications\u201d, Bull. Amer. Math. Soc.\n82 (1976), pp. 126\u2013128.","journal-title":"Bull. Amer. Math. Soc."},{"key":"9_CR16","unstructured":"J. Leon, \u201cComputing Automorphism Groups of Combinatorial Objects\u201d, in Computational Group Theory, edited by M. D. Atkinson, Academic Press (1984), pp. 321\u2013337."},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E. M. Luks","year":"1982","unstructured":"E. M. Luks, \u201cIsomorphisms of Graphs of Bounded Valence Can Be Tested in Polynomial Time\u201d, J. Comp. Sys. Sci.\n25 (1982), pp. 42\u201365.","journal-title":"J. Comp. Sys. Sci."},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1137\/0207038","volume":"7","author":"P. W. Purdom","year":"1978","unstructured":"Paul W. Purdom, \u201cTree Size by Partial Backtracking\u201d, SIAM J. Comput.\n7 (1978), pp. 481\u2013491.","journal-title":"SIAM J. Comput."},{"key":"9_CR19","unstructured":"David A. Seaman, Fast Matrix Multiplication, Indiana University Master's Thesis (1978)."},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"C. C. Sims, \u201cComputation with Permutation Groups\u201d, in Proc. Second Sym. on Symbolic and Algebraic Manipulation, edited by S. R. Petrick, ACM, New York, 1971.","DOI":"10.1145\/800204.806264"},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Volker Strassen, \u201cGaussian Elimination is Not Optimal\u201d, Numer. Math.\n13 (1969), pp. 354\u2013356.","journal-title":"Numer. Math."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51083-4_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T13:05:37Z","timestamp":1580303137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51083-4_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540510833","9783540461524"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-51083-4_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}