{"id":"https://openalex.org/W7161947072","doi":"https://doi.org/10.48550/arxiv.2605.21400","title":"Space-Time Trade-off in Integer Linear Scaling Rounded to the Nearest Integer through Multiplicative and Additive Decomposition","display_name":"Space-Time Trade-off in Integer Linear Scaling Rounded to the Nearest Integer through Multiplicative and Additive Decomposition","publication_year":2026,"publication_date":"2026-05-20","ids":{"openalex":"https://openalex.org/W7161947072","doi":"https://doi.org/10.48550/arxiv.2605.21400"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.21400","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.21400","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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.21400","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100334907","display_name":"Kyeong Soo Kim","orcid":"https://orcid.org/0000-0002-4123-2647"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kim, Kyeong Soo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5100334907"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.4771000146865845,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.4771000146865845,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.20810000598430634,"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"}},{"id":"https://openalex.org/T11034","display_name":"Digital Filter Design and Implementation","score":0.1331000030040741,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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","display_name":"Integer (computer science)","score":0.7792999744415283},{"id":"https://openalex.org/keywords/skew","display_name":"Skew","score":0.6370000243186951},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6312999725341797},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5436000227928162},{"id":"https://openalex.org/keywords/integer-factorization","display_name":"Integer factorization","score":0.45410001277923584},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4528999924659729},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.45159998536109924},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4163999855518341}],"concepts":[{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.7792999744415283},{"id":"https://openalex.org/C43711488","wikidata":"https://www.wikidata.org/wiki/Q7534783","display_name":"Skew","level":2,"score":0.6370000243186951},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6312999725341797},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5942999720573425},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5436000227928162},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4607999920845032},{"id":"https://openalex.org/C119677069","wikidata":"https://www.wikidata.org/wiki/Q4846249","display_name":"Integer factorization","level":4,"score":0.45410001277923584},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4528999924659729},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.45159998536109924},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4163999855518341},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4077000021934509},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.40149998664855957},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.38359999656677246},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.3801000118255615},{"id":"https://openalex.org/C147700949","wikidata":"https://www.wikidata.org/wiki/Q6042594","display_name":"Integer points in convex polyhedra","level":4,"score":0.3504999876022339},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.33340001106262207},{"id":"https://openalex.org/C30860621","wikidata":"https://www.wikidata.org/wiki/Q49008","display_name":"Prime factor","level":3,"score":0.3116999864578247},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C23230895","wikidata":"https://www.wikidata.org/wiki/Q104752","display_name":"Coprime integers","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25920000672340393}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.21400","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.21400","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.21400","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.21400","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,196],"formulate":[1],"the":[2,13,18,28,36,83,86,92,97,101,111,138,143,153,157,170,179,188,192,208,228,243,252,257,264,270],"problem":[3,84],"of":[4,12,20,31,39,82,85,103,118,145,156,181,191,251,260,267,269],"clock":[5,119,209,229,271],"skew":[6,120,210,230,272],"compensation":[7,121,211,231,245,273],"as":[8],"a":[9,77,115],"special":[10],"case":[11],"integer":[14,32,47,87,140,159,194],"linear":[15,88],"scaling":[16,89],"in":[17,114,164],"form":[19],"iD/A":[21],"and":[22,35,79,107,129,247,256],"propose":[23],"two":[24,123],"algorithms":[25,74,220,255],"--":[26,43],"i.e.,":[27],"multiplicative":[29],"decomposition":[30,38,73,254],"division":[33],"(MDID)":[34],"additive":[37],"direct":[40],"search":[41],"(ADDS)":[42],"for":[44],"its":[45],"nearest":[46,93,139],"solution,":[48],"which":[49,238],"are":[50,225],"not":[51],"only":[52],"immune":[53],"to":[54,91,207,227],"floating-point":[55,216,236,276],"precision":[56],"loss":[57],"but":[58,161,177],"also":[59,197],"non-incremental":[60],"unlike":[61],"our":[62],"prior":[63],"approaches":[64,187],"based":[65,75,126,201,212,221,232,274],"on":[66,76,127,202,213,222,233,275],"Bresenham's":[67],"algorithm.":[68],"Having":[69],"theoretically":[70],"established":[71],"both":[72,173,219],"unified":[78],"rigorous":[80],"formulation":[81],"rounded":[90],"integer,":[94],"we":[95,132],"discuss":[96],"space-time":[98],"trade-off":[99,241],"through":[100],"analysis":[102],"their":[104],"computational":[105,183],"complexities":[106],"non-overflow":[108],"conditions.":[109],"Through":[110],"numerical":[112],"examples":[113],"practical":[116],"context":[117],"under":[122,172],"different":[124],"scenarios":[125,174],"32-bit":[128,203],"64-bit":[130,214,223],"integers,":[131],"observe":[133,198],"that":[134,199],"MDID":[135],"can":[136,167],"obtain":[137],"solutions":[141],"with":[142],"complexity":[144,184,250],"O(1)":[146],"when":[147,185],"D":[148],"is":[149,205],"much":[150],"smaller":[151],"than":[152],"maximum":[154,189],"value":[155,190],"underlying":[158,193],"type":[160],"overflows":[162,176,261],"otherwise;":[163],"comparison,":[165],"ADDS":[166,200],"handle":[168],"all":[169],"cases":[171],"without":[175],"at":[178],"expense":[180],"increased":[182],"i":[186],"type.":[195],"integers":[204,224],"equivalent":[206,226],"double-precision":[215],"arithmetic,":[217,237],"while":[218],"128-bit":[234],"quadruple-precision":[235],"highlights":[239],"another":[240],"between":[242],"bounded":[244],"errors":[246],"lower":[248,258],"space":[249],"integer-based":[253],"chances":[259],"resulting":[262],"from":[263],"wide":[265],"ranges":[266],"numbers":[268],"arithmetic.":[277]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-22T00:00:00"}