{"id":"https://openalex.org/W4390589948","doi":"https://doi.org/10.1137/1.9781611977936.11","title":"Improved Algorithms for Integer Complexity","display_name":"Improved Algorithms for Integer Complexity","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4390589948","doi":"https://doi.org/10.1137/1.9781611977936.11"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611977936.11","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/1.9781611977936.11","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 Symposium on Simplicity in Algorithms (SOSA)","raw_type":"book-chapter"},"type":"conference-paper","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/A5030972995","display_name":"Qizheng He","orcid":"https://orcid.org/0000-0002-2518-1114"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Qizheng He","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5030972995"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00356935,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"107","last_page":"114"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9819999933242798,"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/T11130","display_name":"Coding theory and cryptography","score":0.9819999933242798,"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/T12069","display_name":"Commutative Algebra and Its Applications","score":0.9682999849319458,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9632999897003174,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.8309260010719299},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5953776836395264},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5009636878967285},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47268086671829224},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4573575258255005},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.45649802684783936},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4530009627342224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45127880573272705},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.440681517124176},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44023752212524414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3665716052055359}],"concepts":[{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.8309260010719299},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5953776836395264},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5009636878967285},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47268086671829224},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4573575258255005},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.45649802684783936},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4530009627342224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45127880573272705},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.440681517124176},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44023752212524414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3665716052055359},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611977936.11","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/1.9781611977936.11","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 Symposium on Simplicity in Algorithms (SOSA)","raw_type":"book-chapter"}],"best_oa_location":null,"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/W4308171630","https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W1589381382","https://openalex.org/W961142965","https://openalex.org/W2089134982","https://openalex.org/W4390579151"],"abstract_inverted_index":{"The":[0],"integer":[1,8,37],"complexity":[2],"f":[3],"(n)":[4],"of":[5,16],"a":[6],"positive":[7],"n":[9],"is":[10],"defined":[11],"as":[12],"the":[13,36],"minimum":[14],"number":[15],"1's":[17],"needed":[18],"to":[19],"represent":[20],"n,":[21],"using":[22],"additions,":[23],"multiplications":[24],"and":[25,31],"parentheses.":[26],"We":[27],"present":[28],"two":[29],"simple":[30],"faster":[32],"algorithms":[33],"for":[34],"computing":[35],"complexity:":[38]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}