{"id":"https://openalex.org/W7165663741","doi":"https://doi.org/10.48550/arxiv.2606.23471","title":"Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method","display_name":"Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method","publication_year":2026,"publication_date":"2026-06-22","ids":{"openalex":"https://openalex.org/W7165663741","doi":"https://doi.org/10.48550/arxiv.2606.23471"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.23471","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23471","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2606.23471","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054608218","display_name":"Eduardo Yuji Sakabe","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sakabe, Eduardo Yuji","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137746871","display_name":"Felipe S. Abrah\u00e3o","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abrah\u00e3o, Felipe S.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086876799","display_name":"Santiago Hern\u00e1ndez-Orozco","orcid":"https://orcid.org/0000-0001-6041-6700"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hern\u00e1ndez-Orozco, Santiago","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031750747","display_name":"RICARDO GUDWIN","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gudwin, Ricardo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139191624","display_name":"Hector Zenil","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zenil, Hector","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.7240999937057495,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.7240999937057495,"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/T11269","display_name":"Algorithms and Data Compression","score":0.09430000185966492,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.05389999970793724,"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/lossless-compression","display_name":"Lossless compression","score":0.5774000287055969},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.550599992275238},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4657999873161316},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4634999930858612},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.45980000495910645},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4309999942779541},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.4052000045776367},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4047999978065491},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.37950000166893005},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.37709999084472656}],"concepts":[{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.5774000287055969},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.550599992275238},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5080000162124634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48410001397132874},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48399999737739563},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4657999873161316},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4634999930858612},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.45980000495910645},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4309999942779541},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.4052000045776367},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4047999978065491},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4034999907016754},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.37950000166893005},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.37709999084472656},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35740000009536743},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3301999866962433},{"id":"https://openalex.org/C2983064736","wikidata":"https://www.wikidata.org/wiki/Q20779668","display_name":"Algorithmic complexity","level":2,"score":0.3149000108242035},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C127964446","wikidata":"https://www.wikidata.org/wiki/Q1092142","display_name":"Computational resource","level":3,"score":0.3057999908924103},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.3052999973297119},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.2818000018596649},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.28139999508857727},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C101721835","wikidata":"https://www.wikidata.org/wiki/Q813908","display_name":"Conditional entropy","level":3,"score":0.26190000772476196},{"id":"https://openalex.org/C152139883","wikidata":"https://www.wikidata.org/wiki/Q252973","display_name":"Mutual information","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C134765980","wikidata":"https://www.wikidata.org/wiki/Q879126","display_name":"Bitwise operation","level":2,"score":0.2549999952316284},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2549000084400177},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.25189998745918274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.23471","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23471","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.23471","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23471","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Block":[1],"Decomposition":[2],"Method":[3,37],"(BDM)":[4],"was":[5],"introduced":[6],"as":[7,16,113,145],"an":[8,92],"alternative":[9],"to":[10,42,76,169],"popular":[11],"lossless":[12],"compression":[13],"methods":[14],"such":[15],"LZW":[17],"for":[18,101,185],"estimating":[19],"algorithmic":[20,26,50,114,139,170],"complexity":[21,51,190,193],"from":[22,39],"the":[23,34,78,81,89,126,135,166,174,177],"principles":[24],"of":[25,49,56,67,80,91,99,110,137],"probability":[27],"and":[28,94,125,181,191],"classical":[29],"information":[30],"theory.":[31],"It":[32],"extends":[33],"Coding":[35],"Theorem":[36],"(CTM)":[38],"small":[40],"objects":[41],"larger":[43],"ones":[44],"by":[45,134],"combining":[46],"local":[47],"estimates":[48],"with":[52,176],"a":[53,65,146,183],"global":[54],"account":[55],"repetition":[57],"based":[58,83],"on":[59,84,95],"Shannon":[60],"entropy.":[61],"Here,":[62],"we":[63],"introduce":[64],"version":[66],"BDM":[68,179],"in":[69,88,129],"which":[70,159],"dependencies":[71],"between":[72,104],"blocks":[73],"are":[74],"utilized":[75],"reduce":[77],"length":[79,131],"description":[82,130],"reusable":[85],"program":[86],"code":[87],"decomposition":[90],"object,":[93],"conditional":[96,192],"descriptions":[97],"capable":[98],"accounting":[100],"shared":[102,138],"structure":[103],"observations.":[105],"We":[106,141],"formalize":[107],"this":[108,143],"allocation":[109],"descriptive":[111],"resources":[112],"attention.":[115],"Repeated":[116],"or":[117],"related":[118],"components":[119],"need":[120],"not":[121],"be":[122],"described":[123],"independently,":[124],"resulting":[127],"reduction":[128],"is":[132,154],"governed":[133],"amount":[136],"information.":[140],"formulate":[142],"extension":[144],"reuse":[147],"optimization":[148,153],"problem,":[149],"show":[150],"that":[151],"exact":[152],"NP-hard,":[155],"derive":[156],"conditions":[157],"under":[158],"it":[160],"improves":[161],"upon":[162],"independent":[163],"descriptions,":[164],"relate":[165],"achievable":[167],"gains":[168],"mutual":[171],"information,":[172],"prove":[173],"relationship":[175],"previous":[178],"version,":[180],"provide":[182],"roadmap":[184],"its":[186],"implementation":[187],"using":[188],"CTM-derived":[189],"estimates.":[194]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-24T00:00:00"}