{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:23:29Z","timestamp":1730193809122,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T00:00:00Z","timestamp":1695254400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T00:00:00Z","timestamp":1695254400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,9,21]]},"DOI":"10.1109\/acit58437.2023.10275419","type":"proceedings-article","created":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T13:43:37Z","timestamp":1697550217000},"page":"29-34","source":"Crossref","is-referenced-by-count":0,"title":["A Perusal of Algrebraic and Computational Modelling on Matrix Multiplication Time Complexity"],"prefix":"10.1109","author":[{"given":"Manan Roy","family":"Choudhury","sequence":"first","affiliation":[{"name":"Government College of Engineering and Textile Technology,Computer Science and Engineering,Serampore,West Bengal,India"}]},{"given":"Ishan","family":"Banerjee","sequence":"additional","affiliation":[{"name":"Chennai Mathematical Institute,Mathematics and Computing,Chennai,Tamil Nadu,India"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1137\/S0097539704442684","article-title":"Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication","volume":"36","author":"petros","year":"2006","journal-title":"SIAM Journal on Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2021.101572"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0909040"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2011.10.011"},{"key":"ref10","first-page":"101888","article-title":"Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science, Differential Geometry and its Applications","author":"landsberg","year":"2022","journal-title":"Landsberg\/Lech"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.4086\/toc.gs.2013.005"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.32"},{"key":"ref17","article-title":"Algorithms for matrix multiplication","author":"richard","year":"1970","journal-title":"Dept Sci Comput Stanford Univ"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00129836","article-title":"Using Strassen's Algorithm to Accelerate the Solution of Linear Systems","volume":"4","author":"bailey","year":"1990","journal-title":"Journal of Supercomputing"},{"key":"ref19","article-title":"A set of level 3 basic linear algebra subprograms","volume":"16","author":"dongarra","year":"2009","journal-title":"ACM Trans Math Software"},{"key":"ref18","first-page":"341","article-title":"On the implementation of Strassen's fast multiplication algorithm","author":"jacques","year":"1976","journal-title":"Acta Informatica"},{"key":"ref24","first-page":"55","article-title":"Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm","author":"boyer","year":"2009","journal-title":"Proceedings of the international symposium on Symbolic and algebraic computation  - ISSAC '94"},{"article-title":"On the complexity of matrix multiplication","year":"2010","author":"james","key":"ref23"},{"key":"ref26","first-page":"887","article-title":"Multiplying matrices faster than Coppersmith-Winograd","year":"2012","journal-title":"STOC"},{"journal-title":"Ph D thesis","article-title":"On the complexity of matrix multiplication","year":"2010","key":"ref25"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1994.1001"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21545-6_31"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S0308210511001648"},{"key":"ref28","article-title":"Polynomials and the exponent of matrix multiplication","author":"luca","year":"0","journal-title":"Bull Lond Math Soc"},{"key":"ref27","article-title":"Plethysm and fast matrix multiplication","author":"tim","year":"2018","journal-title":"C R Math Acad Sci Paris"},{"key":"ref29","article-title":"Data loci in algebraic optimization","volume":"226","author":"emil","year":"2022","journal-title":"Journal of Pure and Applied Algebra"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2022.107142"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.jsc.2016.07.004","article-title":"On the arithmetic complexity of Strassen-like matrix multiplications","volume":"80","author":"murat","year":"2017","journal-title":"Journal of Symbolic Computation"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2021.04.005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.39"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/369028.369096"},{"key":"ref6","article-title":"A practical streaming approximate matrix multiplication algorithm","author":"francis","year":"2018","journal-title":"Journal of King Saud University - Computer and Information Sciences"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2011.10.011"}],"event":{"name":"2023 13th International Conference on Advanced Computer Information Technologies (ACIT)","start":{"date-parts":[[2023,9,21]]},"location":"Wroc\u0142aw, Poland","end":{"date-parts":[[2023,9,23]]}},"container-title":["2023 13th International Conference on Advanced Computer Information Technologies (ACIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10275066\/10275327\/10275419.pdf?arnumber=10275419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T13:57:57Z","timestamp":1699279077000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10275419\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,21]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/acit58437.2023.10275419","relation":{},"subject":[],"published":{"date-parts":[[2023,9,21]]}}}