{"id":"https://openalex.org/W4415368206","doi":"https://doi.org/10.1109/isit63088.2025.11195428","title":"A Unified Approach and Solutions for $n$-Task Problems","display_name":"A Unified Approach and Solutions for $n$-Task Problems","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368206","doi":"https://doi.org/10.1109/isit63088.2025.11195428"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195428","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195428","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","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/A5050372172","display_name":"Daiki Suruga","orcid":"https://orcid.org/0000-0003-2275-8325"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Daiki Suruga","raw_affiliation_strings":["Graduate School of Mathematics, Nagoya University,Nagoya,Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Mathematics, Nagoya University,Nagoya,Japan","institution_ids":["https://openalex.org/I60134161"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050372172"],"corresponding_institution_ids":["https://openalex.org/I60134161"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.44391972,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9769999980926514,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9769999980926514,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12176","display_name":"Optimization and Packing Problems","score":0.9724000096321106,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9473999738693237,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/question-answering","display_name":"Question answering","score":0.3785000145435333},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.3068999946117401},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.29190000891685486},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.2867000102996826},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.2827000021934509}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6152999997138977},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44179999828338623},{"id":"https://openalex.org/C44291984","wikidata":"https://www.wikidata.org/wiki/Q1074173","display_name":"Question answering","level":2,"score":0.3785000145435333},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.3068999946117401},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29190000891685486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28929999470710754},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.2867000102996826},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.2827000021934509},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2815000116825104},{"id":"https://openalex.org/C99016210","wikidata":"https://www.wikidata.org/wiki/Q5488129","display_name":"Query expansion","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.25940001010894775}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195428","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195428","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1409569118","https://openalex.org/W1507711139","https://openalex.org/W1523387560","https://openalex.org/W1971908132","https://openalex.org/W1995875735","https://openalex.org/W2021736779","https://openalex.org/W2033261280","https://openalex.org/W2086467753","https://openalex.org/W2097066503","https://openalex.org/W2107917944","https://openalex.org/W2110110846","https://openalex.org/W2114607430","https://openalex.org/W2150560365","https://openalex.org/W2201563107","https://openalex.org/W2294870549","https://openalex.org/W2548783102","https://openalex.org/W2612101882","https://openalex.org/W2767315450","https://openalex.org/W2963218519","https://openalex.org/W2963864626","https://openalex.org/W2990961515","https://openalex.org/W3127093867","https://openalex.org/W4220706244","https://openalex.org/W4242137535","https://openalex.org/W4298227433","https://openalex.org/W4390486190","https://openalex.org/W4408128246"],"related_works":[],"abstract_inverted_index":{"A":[0],"fundamental":[1,86],"question":[2,24],"in":[3,29,49,97],"information":[4,34],"technology":[5],"and":[6,38,76],"computer":[7],"science":[8],"is:":[9],"Is":[10],"it":[11],"harder":[12],"to":[13,19],"complete":[14,20],"n":[15],"tasks":[16,96],"independently":[17],"than":[18],"them":[21],"simultaneously?":[22],"This":[23],"has":[25,46],"received":[26],"much":[27],"attention":[28],"several":[30],"research":[31,52],"fields":[32],"including":[33],"theory,":[35],"query":[36,74],"complexity,":[37],"communication":[39],"complexity.":[40],"Despite":[41],"its":[42],"importance,":[43],"however,":[44],"little":[45],"been":[47],"discovered":[48],"many":[50,69],"other":[51],"fields.":[53],"In":[54],"this":[55],"paper,":[56],"we":[57,82],"investigate":[58],"such":[59,72],"problems":[60,90],"based":[61],"a":[62,85],"unified":[63],"framework":[64],"that":[65],"is":[66,104],"capable":[67],"of":[68,91],"different":[70],"situations":[71],"as":[73],"complexity":[75],"learning":[77],"processes.":[78],"Within":[79],"our":[80],"framework,":[81],"then":[83],"prove":[84],"theorem":[87],"answering":[88],"the":[89,98],"solving":[92],"<tex":[93],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[94],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[95],"asymptotic":[99],"regime.":[100],"The":[101],"full":[102],"paper":[103],"available":[105],"at":[106],"arXiv":[107],"[1].":[108]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}