{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:50:41Z","timestamp":1761663041532},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T00:00:00Z","timestamp":1349049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/Crown.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1109\/tevc.2011.2159270","type":"journal-article","created":{"date-parts":[[2012,2,10]],"date-time":"2012-02-10T19:25:48Z","timestamp":1328901948000},"page":"749-751","source":"Crossref","is-referenced-by-count":10,"title":["Genetic Algorithms for Discovery of Matrix Multiplication Methods"],"prefix":"10.1109","volume":"16","author":[{"given":"A.","family":"Joo","sequence":"first","affiliation":[]},{"given":"A.","family":"Ekart","sequence":"additional","affiliation":[]},{"given":"J. P.","family":"Neirotti","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011375326814"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44693-1_9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"ref6","first-page":"161","article-title":"Evolutionary search for matrix multiplication algorithms","author":"kolen","year":"2001","journal-title":"Proc FLAIRS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0215043"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1109\/TEVC.2009.2029568","article-title":"Automatic reproduction of a genius algorithm: Strassen's algorithm revisited by genetic search","volume":"14","author":"oh","year":"2010","journal-title":"IEEE Trans Evol Comput"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1976-13988-2"},{"key":"ref2","author":"bard","year":"2008","journal-title":"A Practical Algorithm for Massively-Parallel Dense Matrix Multiplication in Time Over Any Field Someday But for Now the Reals"},{"key":"ref1","author":"bard","year":"0","journal-title":"New Practical Strassen-Like Approximate Matrix Multiplication Algorithms Found via Solving a System of Cubic Equations"},{"key":"ref9","author":"sanderson","year":"2010","journal-title":"Armadillo An open source C++ linear algebra library for fast prototyping and computationally intensive experiments"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4235\/6314483\/06151102.pdf?arnumber=6151102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:52:26Z","timestamp":1642006346000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6151102\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":10,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2011.2159270","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10]]}}}