{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:39Z","timestamp":1740107859962,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472143","61562071"],"award-info":[{"award-number":["61472143","61562071"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004479","name":"Natural Science Foundation of Jiangxi Province","doi-asserted-by":"publisher","award":["20151BAB207020"],"award-info":[{"award-number":["20151BAB207020"]}],"id":[{"id":"10.13039\/501100004479","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00500-016-2259-y","type":"journal-article","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T05:18:49Z","timestamp":1468214329000},"page":"7159-7171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Ant colony optimization for triple product property triples to fast matrix multiplication"],"prefix":"10.1007","volume":"21","author":[{"given":"Xinsheng","family":"Lai","sequence":"first","affiliation":[]},{"given":"Yuren","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Xiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"key":"2259_CR1","doi-asserted-by":"crossref","unstructured":"Ambainis A, Filmus Y, Le\u00a0Gall F (2015) Fast matrix multiplication: limitations of the coppersmith-winograd method. In: Proceedings of the forty-seventh annual acm symposium on theory of computing, pp 585\u2013593","DOI":"10.1145\/2746539.2746554"},{"issue":"5","key":"2259_CR2","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/0020-0190(79)90113-3","volume":"8","author":"D Bini","year":"1979","unstructured":"Bini D, Capovani M, Romani F, Lotti G (1979) $$\\text{ O }(n^{2.7799})$$ O ( n 2.7799 ) complexity for $$n\\times n$$ n \u00d7 n approximate matrix multiplication. Inf Process Lett 8(5):234\u2013235","journal-title":"Inf Process Lett"},{"issue":"6","key":"2259_CR3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0020-0190(95)00176-X","volume":"56","author":"NH Bshouty","year":"1995","unstructured":"Bshouty NH (1995) On the additive complexity of $$2\\times 2$$ 2 \u00d7 2 matrix multiplication. Inf Process Lett 56(6):329\u2013335","journal-title":"Inf Process Lett"},{"key":"2259_CR4","doi-asserted-by":"crossref","unstructured":"Cohn H, Umans C (2003) A group-theoretic approach to fast matrix multiplication. In: Proceedings of 44th annual IEEE symposium on foundations of computer science, IEEE Computer Society, pp 438\u2013449","DOI":"10.1109\/SFCS.2003.1238217"},{"issue":"3","key":"2259_CR5","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/0211038","volume":"11","author":"D Coppersmith","year":"1982","unstructured":"Coppersmith D, Winograd S (1982) On the asymptotic complexity of matrix multiplication. SIAM J Comput 11(3):472\u2013492","journal-title":"SIAM J Comput"},{"issue":"3","key":"2259_CR6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith D, Winograd S (1990) Matrix multiplication via arithmetic progressions. J Symb Comput 9(3):251\u2013280","journal-title":"J Symb Comput"},{"issue":"1","key":"2259_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"issue":"1","key":"2259_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1515\/gcc-2015-0001","volume":"7","author":"S Hart","year":"2015","unstructured":"Hart S, Hedtke I, M\u00fcller-Hannemann M, Murthy S (2015) A fast search algorithm for $$<m, m, m>$$ < m , m , m > triple product property triples and an application for 5 $$\\times $$ \u00d7 5 matrix multiplication. Groups Complexity Cryptol 7(1):31\u201346","journal-title":"Groups Complexity Cryptol"},{"issue":"1","key":"2259_CR9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1515\/gcc-2012-0006","volume":"4","author":"I Hedtke","year":"2012","unstructured":"Hedtke I, Murthy S (2012) Search and test algorithms for triple product property triples. Groups Complex Cryptol 4(1):111\u2013133","journal-title":"Groups Complex Cryptol"},{"key":"2259_CR10","doi-asserted-by":"crossref","unstructured":"Hopcroft JE, Kerr LR (1969) Some techniques for proving certain simple programs optimal. In: IEEE conference record of 10th annual symposium on switching and automata theory, pp 36\u201345","DOI":"10.1109\/SWAT.1969.21"},{"issue":"6","key":"2259_CR11","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1109\/4235.974841","volume":"5","author":"T Jansen","year":"2001","unstructured":"Jansen T, Wegener I (2001) Evolutionary algorithms: how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans Evol Comput 5(6):589\u2013599","journal-title":"IEEE Trans Evol Comput"},{"key":"2259_CR12","doi-asserted-by":"crossref","unstructured":"Le\u00a0Gall F (2014) Powers of tensors and fast matrix multiplication. Eprint Arxiv pp 296\u2013303","DOI":"10.1145\/2608628.2608664"},{"issue":"1","key":"2259_CR13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s11721-008-0023-3","volume":"3","author":"F Neumann","year":"2009","unstructured":"Neumann F, Sudholt D, Witt C (2009) Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intell 3(1):35\u201368","journal-title":"Swarm Intell"},{"issue":"14","key":"2259_CR14","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1112\/S1461157010000288","volume":"14","author":"PM Neumann","year":"2011","unstructured":"Neumann PM (2011) A note on the triple product property for subsets of finite groups. LMS J Comput Math 14(14):232\u2013237","journal-title":"LMS J Comput Math"},{"key":"2259_CR15","doi-asserted-by":"crossref","unstructured":"Pan VY (1978) Strassen\u2019s algorithm is not optimal, trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations. In: Proceedings of the 19th annual symposium on foundations of computer science, pp 166\u2013176","DOI":"10.1109\/SFCS.1978.34"},{"issue":"2","key":"2259_CR16","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1137\/0209027","volume":"9","author":"VY Pan","year":"1980","unstructured":"Pan VY (1980) New fast algorithms for matrix operations. SIAM J Comput 9(2):321\u2013342","journal-title":"SIAM J Comput"},{"issue":"3","key":"2259_CR17","doi-asserted-by":"crossref","first-page":"21","DOI":"10.5815\/ijigsp.2014.03.03","volume":"6","author":"P Rai","year":"2014","unstructured":"Rai P (2014) Edge detection of medical images using modified ant colony optimization algorithm based on weighted heuristics. Int J Image Gr Signal Process 6(3):21\u201326","journal-title":"Int J Image Gr Signal Process"},{"key":"2259_CR18","doi-asserted-by":"crossref","unstructured":"Salama K, Abdelbar AM (2014) A novel ant colony algorithm for building neural network topologies. In: Proceedings of the 9th international conference on ant colony optimization and swarm intelligence, ANTS 2014, Brussels, Belgium, September 10\u201312, pp 1\u201312","DOI":"10.1007\/978-3-319-09952-1_1"},{"issue":"3","key":"2259_CR19","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1137\/0210032","volume":"10","author":"A Sch\u00f6nhage","year":"1981","unstructured":"Sch\u00f6nhage A (1981) Partial and total matrix multiplication. SIAM J Comput 10(3):434\u2013455","journal-title":"SIAM J Comput"},{"key":"2259_CR20","unstructured":"Stothers A (2010) On the complexity of matrix multiplication. Ph.D. thesis, University of Edinburgh"},{"issue":"4","key":"2259_CR21","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen V (1969) Gaussian elimination is not optimal. Numer Math 13(4):354\u2013356","journal-title":"Numer Math"},{"key":"2259_CR22","first-page":"406","volume":"375\u2013376","author":"V Strassen","year":"1987","unstructured":"Strassen V (1987) Relative bilinear complexity and matrix multiplication. J F\u00fcr Die Reine Und Angewandte Math 375\u2013376:406\u2013443","journal-title":"J F\u00fcr Die Reine Und Angewandte Math"},{"issue":"8","key":"2259_CR23","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) Max\u2013Min ant system. Future Gener Comput Syst 16(8):889\u2013914","journal-title":"Future Gener Comput Syst"},{"key":"2259_CR24","doi-asserted-by":"crossref","unstructured":"Williams VV (2012) Multiplying matrices faster than coppersmith-winograd. In: Proceedings of the forty-fourth annual acm symposium on theory of computing, pp 887\u2013898","DOI":"10.1145\/2213977.2214056"},{"issue":"4","key":"2259_CR25","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 (1971) On multiplication of $$2\\times 2$$ 2 \u00d7 2 matrices. Linear Algebra Appl 4(4):381\u2013388","journal-title":"Linear Algebra Appl"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2259-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2259-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2259-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2259-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T20:09:20Z","timestamp":1568146160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2259-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":25,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["2259"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2259-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2016,7,11]]}}}