{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T21:40:03Z","timestamp":1750801203585,"version":"3.41.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319662626"},{"type":"electronic","value":"9783319662633"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-66263-3_7","type":"book-chapter","created":{"date-parts":[[2017,8,8]],"date-time":"2017-08-08T08:05:11Z","timestamp":1502179511000},"page":"101-118","source":"Crossref","is-referenced-by-count":0,"title":["An Adaptive Prefix-Assignment Technique for Symmetry Reduction"],"prefix":"10.1007","author":[{"given":"Tommi","family":"Junttila","sequence":"first","affiliation":[]},{"given":"Matti","family":"Karppa","sequence":"additional","affiliation":[]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[]},{"given":"Jukka","family":"Kohonen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,9]]},"reference":[{"key":"7_CR1","unstructured":"Alekseev, V.B.: On bilinear complexity of multiplication of $$5\\times 2$$ matrix by $$2\\times 2$$ matrix. Physics and mathematics, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, vol. 156, pp. 19\u201329. Kazan University, Kazan (2014)"},{"issue":"4","key":"7_CR2","first-page":"11","volume":"16","author":"VB Alekseev","year":"2015","unstructured":"Alekseev, V.B.: On bilinear complexity of multiplication of $$m\\times 2$$ and $$2\\times 2$$ matrices. Chebyshevskii Sb. 16(4), 11\u201327 (2015)","journal-title":"Chebyshevskii Sb."},{"issue":"1","key":"7_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1134\/S0081543813070079","volume":"282","author":"VB Alekseev","year":"2013","unstructured":"Alekseev, V.B., Smirnov, A.V.: On the exact and approximate bilinear complexities of multiplication of $$4\\times 2$$ and $$2\\times 2$$ matrices. Proc. Steklov Inst. Math. 282(1), 123\u2013139 (2013)","journal-title":"Proc. Steklov Inst. Math."},{"issue":"1","key":"7_CR4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0196-6774(85)90019-7","volume":"6","author":"VB Alekseyev","year":"1985","unstructured":"Alekseyev, V.B.: On the complexity of some algorithms of matrix multiplication. J. Algorithms 6(1), 71\u201385 (1985)","journal-title":"J. Algorithms"},{"key":"7_CR5","unstructured":"Aloul, F.A., Sakallah, K.A., Markov, I.L.: Efficient symmetry breaking for boolean satisfiability. In: Proceedings of the IJCAI 2003, pp. 271\u2013276. Morgan Kaufmann (2003)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-40970-2_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"G Audemard","year":"2016","unstructured":"Audemard, G., Simon, L.: Extreme cases in SAT problems. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 87\u2013103. Springer, Cham (2016). doi: 10.1007\/978-3-319-40970-2_7"},{"key":"7_CR7","unstructured":"Biere, A.: Splatz, Lingeling, Plingeling, Treengeling, YalSAT entering the SAT Competition 2016. In: Proceedings of SAT Competition 2016 - Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2016-1, pp. 44\u201345. University of Helsinki (2016)"},{"issue":"3","key":"7_CR8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s000370050028","volume":"8","author":"M Bl\u00e4ser","year":"1999","unstructured":"Bl\u00e4ser, M.: Lower bounds for the multiplicative complexity of matrix multiplication. Comput. Complex. 8(3), 203\u2013226 (1999)","journal-title":"Comput. Complex."},{"issue":"1","key":"7_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0885-064X(02)00007-9","volume":"19","author":"M Bl\u00e4ser","year":"2003","unstructured":"Bl\u00e4ser, M.: On the complexity of the multiplication of matrices of small formats. J. Complex. 19(1), 43\u201360 (2003)","journal-title":"J. Complex."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Fundamental Algorithms for Permutation Groups","year":"1991","unstructured":"Butler, G. (ed.): Fundamental Algorithms for Permutation Groups. LNCS, vol. 559. Springer, Heidelberg (1991)"},{"issue":"4","key":"7_CR11","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/s10601-014-9163-9","volume":"19","author":"G Chu","year":"2014","unstructured":"Chu, G., de la Banda, M.G., Mears, C., Stuckey, P.J.: Symmetries, almost symmetries, and lazy clause generation. Constraints 19(4), 434\u2013462 (2014)","journal-title":"Constraints"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-44953-1_11","volume-title":"Principles and Practice of Constraint Programming","author":"M Codish","year":"2016","unstructured":"Codish, M., Gange, G., Itzhakov, A., Stuckey, P.J.: Breaking symmetries in graphs: the nauty way. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 157\u2013172. Springer, Cham (2016). doi: 10.1007\/978-3-319-44953-1_11"},{"key":"7_CR13","unstructured":"Courtois, N.T., Hulme, D., Mourouzis, T.: Multiplicative complexity and solving generalized Brent equations with SAT solvers. In: Proceedings of the Third International Conference on Computational Logics, Algebras, Programming, Tools, and Benchmarking (COMPUTATION TOOLS 2012), pp. 22\u201327 (2012)"},{"key":"7_CR14","unstructured":"Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: Proceedings of the KR 1996, pp. 148\u2013159. Morgan Kaufmann (1996)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for CNF. In: Proceedings of the DAC 2004, pp. 530\u2013534. ACM (2004)","DOI":"10.1145\/996566.996712"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-40970-2_8","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"J Devriendt","year":"2016","unstructured":"Devriendt, J., Bogaerts, B., Bruynooghe, M., Denecker, M.: Improved static symmetry breaking for SAT. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 104\u2013122. Springer, Cham (2016). doi: 10.1007\/978-3-319-40970-2_8"},{"key":"7_CR17","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0731-3","volume-title":"Permutation Groups","author":"JD Dixon","year":"1996","unstructured":"Dixon, J.D., Mortimer, B.: Permutation Groups. Graduate Texts in Mathematics, vol. 163. Springer, New York (1996)"},{"key":"7_CR18","unstructured":"Farad\u017eev, I.A.: Constructive enumeration of combinatorial objects. In: Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes, pp. 131\u2013135. No. 260 in Colloq. Internat. CNRS, CNRS, Paris (1978)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Petrie, K.E., Puget, J.: Symmetry in constraint programming. In: Handbook of Constraint Programming. Foundations of Artificial Intelligence, vol. 2, pp. 329\u2013376. Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80014-3"},{"issue":"2, Part 2","key":"7_CR20","doi-asserted-by":"crossref","first-page":"21","DOI":"10.2307\/2313307","volume":"72","author":"M Hall Jr","year":"1965","unstructured":"Hall Jr., M., Knuth, D.E.: Combinatorial analysis and computers. Amer. Math. Monthly 72(2, Part 2), 21\u201328 (1965)","journal-title":"Amer. Math. Monthly"},{"issue":"4","key":"7_CR21","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/0196-6774(90)90014-6","volume":"11","author":"J H\u00e5stad","year":"1990","unstructured":"H\u00e5stad, J.: Tensor rank is NP-complete. J. Algorithms 11(4), 644\u2013654 (1990)","journal-title":"J. Algorithms"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-34188-5_8","volume-title":"Hardware and Software: Verification and Testing","author":"MJH Heule","year":"2012","unstructured":"Heule, M.J.H., Kullmann, O., Wieringa, S., Biere, A.: Cube and conquer: guiding CDCL SAT solvers by lookaheads. In: Eder, K., Louren\u00e7o, J., Shehory, O. (eds.) HVC 2011. LNCS, vol. 7261, pp. 50\u201365. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-34188-5_8"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Heule, M.J.H.: The quest for perfect and compact symmetry breaking for graph problems. In: Proceedings of the SYNASC 2016, pp. 149\u2013156. IEEE Computer Society (2016)","DOI":"10.1109\/SYNASC.2016.034"},{"issue":"1","key":"7_CR24","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0120004","volume":"20","author":"JE Hopcroft","year":"1971","unstructured":"Hopcroft, J.E., Kerr, L.R.: On minimizing the number of multiplications necessary for matrix multiplication. SIAM J. Appl. Math. 20(1), 30\u201336 (1971)","journal-title":"SIAM J. Appl. Math."},{"key":"7_CR25","volume-title":"A Course in Group Theory","author":"JF Humphreys","year":"1996","unstructured":"Humphreys, J.F.: A Course in Group Theory. Oxford University Press, Oxford (1996)"},{"issue":"3","key":"7_CR26","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10601-016-9244-z","volume":"21","author":"A Itzhakov","year":"2016","unstructured":"Itzhakov, A., Codish, M.: Breaking symmetries in graph search with canonizing sets. Constraints 21(3), 357\u2013374 (2016)","journal-title":"Constraints"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Junttila, T., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: Proceedings of the ALENEX 2007. SIAM (2007)","DOI":"10.1137\/1.9781611972870.13"},{"key":"7_CR28","series-title":"Algorithms and Computation in Mathematics","volume-title":"Classification Algorithms for Codes and Designs","author":"P Kaski","year":"2006","unstructured":"Kaski, P., \u00d6sterg\u00e5rd, P.R.J.: Classification Algorithms for Codes and Designs. Algorithms and Computation in Mathematics, vol. 15. Springer, Heidelberg (2006)"},{"key":"7_CR29","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11167-3","volume-title":"Applied Finite Group Actions","author":"A Kerber","year":"1999","unstructured":"Kerber, A.: Applied Finite Group Actions. Algorithms and Combinatorics, vol. 19, 2nd edn. Springer, Heidelberg (1999)","edition":"2"},{"issue":"1\u20133","key":"7_CR30","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1005998722658","volume":"52","author":"A Kerber","year":"1998","unstructured":"Kerber, A., Laue, R.: Group actions, double cosets, and homomorphisms: unifying concepts for the constructive theory of discrete structures. Acta Appl. Math. 52(1\u20133), 63\u201390 (1998)","journal-title":"Acta Appl. Math."},{"key":"7_CR31","unstructured":"Knuth, D.E.: The Art of Computer Programming. Combinatorial Algorithms, vol. 4A, Part 1. Addison-Wesley, Reading (2011)"},{"key":"7_CR32","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1090\/S0002-9904-1976-13988-2","volume":"82","author":"JD Laderman","year":"1976","unstructured":"Laderman, J.D.: A noncommutative algorithm for multiplying $$3 \\times 3$$ matrices using 23 multiplications. Bull. Amer. Math. Soc. 82, 126\u2013128 (1976)","journal-title":"Bull. Amer. Math. Soc."},{"issue":"4\u20135","key":"7_CR33","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/S0747-7171(08)80103-4","volume":"12","author":"JS Leon","year":"1991","unstructured":"Leon, J.S.: Permutation group algorithms based on partitions, I: theory and algorithms. J. Symbol. Comput. 12(4\u20135), 533\u2013583 (1991)","journal-title":"J. Symbol. Comput."},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Leon, J.S.: Partitions, refinements, and permutation group computation. In: Groups and Computation, II, pp. 123\u2013158. No. 28 in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society (1997)","DOI":"10.1090\/dimacs\/028\/10"},{"key":"7_CR35","first-page":"45","volume":"30","author":"BD McKay","year":"1981","unstructured":"McKay, B.D.: Practical graph isomorphism. Congressus Numerantium 30, 45\u201387 (1981)","journal-title":"Congressus Numerantium"},{"issue":"2","key":"7_CR36","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"BD McKay","year":"1998","unstructured":"McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms 26(2), 306\u2013324 (1998)","journal-title":"J. Algorithms"},{"key":"7_CR37","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism. II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"II. J. Symb. Comput."},{"key":"7_CR38","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","volume":"2","author":"RC Read","year":"1978","unstructured":"Read, R.C.: Every one a winner; or, how to avoid isomorphism search when cataloguing combinatorial configurations. Ann. Discrete Math. 2, 107\u2013120 (1978)","journal-title":"Ann. Discrete Math."},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Sakallah, K.A.: Symmetry and satisfiability. In: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 289\u2013338. IOS Press (2009)","DOI":"10.3233\/978-1-58603-929-5-289"},{"key":"7_CR40","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546549","volume-title":"Permutation Group Algorithms","author":"\u00c1 Seress","year":"2003","unstructured":"Seress, \u00c1.: Permutation Group Algorithms. Cambridge University Press, Cambridge (2003)"},{"issue":"4","key":"7_CR41","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13(4), 354\u2013356 (1969)","journal-title":"Numer. Math."},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Swift, J.D.: Isomorph rejection in exhaustive search techniques. In: Combinatorial Analysis, pp. 195\u2013200. American Mathematical Society (1960)","DOI":"10.1090\/psapm\/010\/0114322"},{"key":"7_CR43","unstructured":"Wieringa, S.: The icnf file format (2011). http:\/\/www.siert.nl\/icnf\/ . Accessed April 2017"},{"issue":"4","key":"7_CR44","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0024-3795(71)90009-7","volume":"4","author":"S Winograd","year":"1971","unstructured":"Winograd, S.: On multiplication of $$2 \\times 2$$ matrices. Linear Algebra Appl. 4(4), 381\u2013388 (1971)","journal-title":"Linear Algebra Appl."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66263-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T20:59:52Z","timestamp":1750798792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66263-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319662626","9783319662633"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66263-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}