{"id":"https://openalex.org/W4301181185","doi":"https://doi.org/10.4230/lipics.esa.2023.57","title":"Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication","display_name":"Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication","publication_year":2021,"publication_date":"2021-09-27","ids":{"openalex":"https://openalex.org/W4301181185","doi":"https://doi.org/10.4230/lipics.esa.2023.57"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2109.13335","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2109.13335","pdf_url":"https://arxiv.org/pdf/2109.13335","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2109.13335","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101783327","display_name":"David G. Harris","orcid":"https://orcid.org/0000-0002-3021-3555"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Harris, David G.","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":"https://orcid.org/0000-0002-3021-3555","affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101783327"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25436113,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/strassen-algorithm","display_name":"Strassen algorithm","score":0.9651243686676025},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.774105966091156},{"id":"https://openalex.org/keywords/multiplication-algorithm","display_name":"Multiplication algorithm","score":0.7077131271362305},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.6672044396400452},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.6146655678749084},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5931953191757202},{"id":"https://openalex.org/keywords/freivalds-algorithm","display_name":"Freivalds' algorithm","score":0.4866819977760315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4554126560688019},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44349804520606995},{"id":"https://openalex.org/keywords/logical-matrix","display_name":"Logical matrix","score":0.4267193377017975},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2862565517425537},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20752573013305664},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11904975771903992},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.07760292291641235},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.06144750118255615}],"concepts":[{"id":"https://openalex.org/C39096654","wikidata":"https://www.wikidata.org/wiki/Q728507","display_name":"Strassen algorithm","level":4,"score":0.9651243686676025},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.774105966091156},{"id":"https://openalex.org/C201290732","wikidata":"https://www.wikidata.org/wiki/Q130762","display_name":"Multiplication algorithm","level":3,"score":0.7077131271362305},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.6672044396400452},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.6146655678749084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5931953191757202},{"id":"https://openalex.org/C38506071","wikidata":"https://www.wikidata.org/wiki/Q6522941","display_name":"Freivalds' algorithm","level":5,"score":0.4866819977760315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4554126560688019},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44349804520606995},{"id":"https://openalex.org/C163561899","wikidata":"https://www.wikidata.org/wiki/Q1994977","display_name":"Logical matrix","level":3,"score":0.4267193377017975},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2862565517425537},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20752573013305664},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11904975771903992},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.07760292291641235},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.06144750118255615},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:arXiv.org:2109.13335","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2109.13335","pdf_url":"https://arxiv.org/pdf/2109.13335","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:18710","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.57","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol274-esa2023/LIPIcs.ESA.2023.57/LIPIcs.ESA.2023.57.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.48550/arxiv.2109.13335","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2109.13335","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.4230/lipics.esa.2023.57","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2023.57","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2109.13335","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2109.13335","pdf_url":"https://arxiv.org/pdf/2109.13335","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2170716619","https://openalex.org/W2145889866","https://openalex.org/W2056120647","https://openalex.org/W1974407206","https://openalex.org/W3204033665","https://openalex.org/W2041189380","https://openalex.org/W2232711356","https://openalex.org/W2043670592","https://openalex.org/W1983419392","https://openalex.org/W1978106295"],"abstract_inverted_index":{"Karppa":[0],"&":[1],"Kaski":[2],"(2019)":[3],"proposed":[4],"a":[5,16,110,118,137],"novel":[6],"type":[7],"of":[8,18,95,99,121,140,178],"\"broken\"":[9],"or":[10,89],"\"opportunistic\"":[11],"multiplication":[12,43,54,78],"algorithm,":[13,20],"based":[14],"on":[15,103],"variant":[17],"Strassen\u2019s":[19],"and":[21,116],"used":[22],"this":[23],"to":[24,73,80,147,192],"develop":[25],"new":[26,111,149],"algorithms":[27,55,62],"for":[28,65,86,165,168,184],"Boolean":[29,41,90],"matrix":[30,42,53,77,83,113],"multiplication,":[31,84],"among":[32],"other":[33],"tasks.":[34],"For":[35],"instance,":[36],"their":[37],"algorithm":[38,79,102,128,167,195],"can":[39],"compute":[40,82],"in":[44,58],"O(n^log\u2082(6+6/7)":[45],"log":[46,133],"n)":[47,134],"=":[48],"O(n^2.778)":[49],"time.":[50],"While":[51],"faster":[52],"exist":[56],"asymptotically,":[57],"practice":[59],"most":[60],"such":[61],"are":[63,157,173,189],"infeasible":[64],"practical":[66,150,179],"problems.":[67],"We":[68,161],"describe":[69],"an":[70],"alternative":[71],"way":[72],"use":[74],"the":[75,100,104,122,126,144,163,175],"broken":[76,101,123],"approximately":[81],"either":[85],"real-valued":[87],"matrices":[88],"matrices.":[91],"In":[92],"brief,":[93],"instead":[94],"running":[96],"multiple":[97],"iterations":[98],"original":[105],"input":[106],"matrix,":[107],"we":[108],"form":[109],"larger":[112],"by":[114],"sampling":[115],"run":[117],"single":[119],"iteration":[120],"algorithm.":[124,142],"Asymptotically,":[125],"resulting":[127],"has":[129],"runtime":[130,155,164],"O(n^{(3":[131],"log6)/log7}":[132],"\u2264":[135],"O(n^2.763),":[136],"slight":[138],"improvement":[139],"Karppa-Kaski\u2019s":[141],"Since":[143],"goal":[145],"is":[146],"obtain":[148],"matrix-multiplication":[151],"algorithms,":[152],"these":[153,185],"asymptotic":[154],"bounds":[156],"not":[158],"directly":[159],"useful.":[160],"estimate":[162],"our":[166,194],"some":[169],"sample":[170],"problems":[171],"which":[172],"at":[174],"upper":[176],"limits":[177],"algorithms;":[180],"it":[181],"appears":[182],"that":[183],"parameters,":[186],"further":[187],"optimizations":[188],"still":[190],"needed":[191],"make":[193],"competitive.":[196]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2022-10-04T00:00:00"}