{"id":"https://openalex.org/W2170835539","doi":"https://doi.org/10.1145/1250790.1250800","title":"Faster integer multiplication","display_name":"Faster integer multiplication","publication_year":2007,"publication_date":"2007-06-11","ids":{"openalex":"https://openalex.org/W2170835539","doi":"https://doi.org/10.1145/1250790.1250800","mag":"2170835539"},"language":"en","primary_location":{"id":"doi:10.1145/1250790.1250800","doi":"https://doi.org/10.1145/1250790.1250800","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250800","pdf_url":null,"source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052643589","display_name":"Martin F\u00fcrer","orcid":"https://orcid.org/0000-0001-5354-3226","observed_orcids":["https://orcid.org/0000-0001-5354-3226"]},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Martin F\u00fcrer","raw_affiliation_strings":["Pennsylvania State University, University Park, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, University Park, PA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052643589"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":17.168,"has_fulltext":false,"cited_by_count":254,"citation_normalized_percentile":{"value":0.99776869,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"57","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7519999742507935,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7519999742507935,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.16670000553131104,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11435","display_name":"Polynomial and algebraic computation","score":0.02419999986886978,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/integer-multiplication","display_name":"integer multiplication","score":0.9990000128746033},{"id":"https://openalex.org/keywords/asymptotic-complexity","display_name":"asymptotic complexity","score":0.6200000047683716},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.6669999957084656},{"id":"https://openalex.org/keywords/iterated-logarithm","display_name":"iterated logarithm","score":0.6800000071525574}],"concepts":[{"id":"https://openalex.org/C39096654","wikidata":"https://www.wikidata.org/wiki/Q728507","display_name":"Strassen algorithm","level":4,"score":0.7675985097885132},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.721980631351471},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7180477380752563},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6680746078491211},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6269272565841675},{"id":"https://openalex.org/C201290732","wikidata":"https://www.wikidata.org/wiki/Q130762","display_name":"Multiplication algorithm","level":3,"score":0.5860937237739563},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.5764795541763306},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5480121374130249},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5336257815361023},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5130066275596619},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4424751102924347},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4019174873828888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2963745594024658},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.283199667930603},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.12398234009742737},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.12372434139251709},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08466136455535889},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1250790.1250800","doi":"https://doi.org/10.1145/1250790.1250800","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250800","pdf_url":null,"source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1540038024","https://openalex.org/W1591525908","https://openalex.org/W1649758727","https://openalex.org/W1655990431","https://openalex.org/W1709275931","https://openalex.org/W1972710063","https://openalex.org/W1979175600","https://openalex.org/W1981663184","https://openalex.org/W1989739006","https://openalex.org/W2001121794","https://openalex.org/W2009798194","https://openalex.org/W2011191879","https://openalex.org/W2027377011","https://openalex.org/W2027981423","https://openalex.org/W2061171222","https://openalex.org/W2073557899","https://openalex.org/W2083368929","https://openalex.org/W2097001190","https://openalex.org/W2106805276","https://openalex.org/W2125836499","https://openalex.org/W2135031801","https://openalex.org/W2137279816","https://openalex.org/W2752853835"],"related_works":["https://openalex.org/W1754110195","https://openalex.org/W2273632203","https://openalex.org/W3038599687","https://openalex.org/W2941010932","https://openalex.org/W2067950298","https://openalex.org/W7095604823","https://openalex.org/W1591525908","https://openalex.org/W2405093304","https://openalex.org/W7096912777","https://openalex.org/W2594368247"],"abstract_inverted_index":{"For":[0],"more":[1],"than":[2],"35":[3],"years,":[4],"the":[5,14,46,63],"fastest":[6],"known":[7],"method":[8],"for":[9],"integer":[10],"multiplication":[11],"has":[12,42],"been":[13,44],"Sch\u00f6nhage-Strassen":[15],"algorithm":[16,51,70],"running":[17,71],"in":[18,72],"time":[19,73],"O(n":[20],"log":[21,23,24,35,54,75],"n":[22,74],"n).":[25,55,78],"Under":[26],"certain":[27],"restrictive":[28],"conditions":[29],"there":[30],"is":[31,52],"a":[32,58],"corresponding":[33],"\u03a9(n":[34],"n)":[36],"lower":[37],"bound.":[38],"The":[39],"prevailing":[40],"conjecture":[41],"always":[43],"that":[45],"complexity":[47],"of":[48],"an":[49,69],"optimal":[50],"\u0398(n":[53],"We":[56],"present":[57],"major":[59],"step":[60],"towards":[61],"closing":[62],"gap":[64],"from":[65],"above":[66],"by":[67],"presenting":[68],"n,":[76],"2O(log*":[77]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":21},{"year":2012,"cited_by_count":12}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}