发布求助
文献互助 智能选刊 最新文献

Information Processing Letters最新文献

筛选
英文 中文
Reachability in graphs having linear 2-arboricity two is NL-hard 具有线性2-任意2的图中的可达性是NL-hard
IF 0.6 4区 计算机科学
Information Processing Letters Pub Date : 2026-02-01 Epub Date: 2025-10-10 DOI: 10.1016/j.ipl.2025.106611
Ronak Bhadra, Raghunath Tewari
{"title":"Reachability in graphs having linear 2-arboricity two is NL-hard","authors":"Ronak Bhadra,&nbsp;Raghunath Tewari","doi":"10.1016/j.ipl.2025.106611","DOIUrl":"10.1016/j.ipl.2025.106611","url":null,"abstract":"<div><div>A linear <em>k</em>-diforest is a directed forest consisting of directed paths of length at most <em>k</em>. Linear <em>k</em>-arboricity of a directed graph is defined as the minimum number of linear <em>k</em>-diforests needed to partition the edges of the graph. We show that the problem of deciding reachability in directed graphs having linear 2-arboricity two is <span><math><mi>NL</mi></math></span>-hard and the same is also true for directed graphs having linear 1-arboricity three. Our proof also implies that deciding reachability in such graphs remains hard even when a decomposition into two linear 2-diforests or three linear 1-diforests is provided. We further extend our results for a more restricted notion of linear arboricity, called geometric linear arboricity.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"192 ","pages":"Article 106611"},"PeriodicalIF":0.6,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145269981","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Practical committing attacks against Rocca-S 对Rocca-S实施实际攻击
IF 0.6 4区 计算机科学
Information Processing Letters Pub Date : 2026-02-01 Epub Date: 2025-10-01 DOI: 10.1016/j.ipl.2025.106610
Ryunosuke Takeuchi , Yosuke Todo , Tetsu Iwata
{"title":"Practical committing attacks against Rocca-S","authors":"Ryunosuke Takeuchi ,&nbsp;Yosuke Todo ,&nbsp;Tetsu Iwata","doi":"10.1016/j.ipl.2025.106610","DOIUrl":"10.1016/j.ipl.2025.106610","url":null,"abstract":"<div><div>This paper shows practical committing attacks against Rocca-S, an authenticated encryption with associated data scheme designed for 6G applications. Previously, the best complexity of the attack was 2<sup>64</sup> by Derbez et al. in ToSC 2024(1)/FSE 2024. We show that the committing attack against Rocca by Takeuchi et al. in ToSC 2024(2)/FSE 2025 can be applied to Rocca-S, where Rocca is an earlier version of Rocca-S. We show a concrete test vector of our attack. We also point out a committing attack that exploits equivalent keys.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"192 ","pages":"Article 106610"},"PeriodicalIF":0.6,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145269982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Steiner path aggregation problem 斯坦纳路径聚合问题
IF 0.6 4区 计算机科学
Information Processing Letters Pub Date : 2026-02-01 Epub Date: 2025-09-26 DOI: 10.1016/j.ipl.2025.106608
Da Qi Chen , Daniel Hathcock , D. Ellis Hershkowitz , R. Ravi
{"title":"The Steiner path aggregation problem","authors":"Da Qi Chen ,&nbsp;Daniel Hathcock ,&nbsp;D. Ellis Hershkowitz ,&nbsp;R. Ravi","doi":"10.1016/j.ipl.2025.106608","DOIUrl":"10.1016/j.ipl.2025.106608","url":null,"abstract":"<div><div>In the <em>Steiner Path Aggregation Problem</em>, our goal is to aggregate paths in a directed network into a single arborescence without significantly disrupting the paths. In particular, we are given a directed multigraph with colored arcs, a root, and <em>k</em> terminals, each of which has a monochromatic path to the root. Our goal is to find an arborescence in which every terminal has a path to the root, and its path does not switch colors too many times. We give an efficient algorithm that finds such a solution with at most <span><math><mn>2</mn><msub><mrow><mi>log</mi></mrow><mrow><mfrac><mrow><mn>4</mn></mrow><mrow><mn>3</mn></mrow></mfrac></mrow></msub><mo>⁡</mo><mi>k</mi></math></span> color switches. Up to constant factors this is the best possible universal bound, as there are graphs requiring at least <span><math><msub><mrow><mi>log</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⁡</mo><mi>k</mi></math></span> color switches.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"192 ","pages":"Article 106608"},"PeriodicalIF":0.6,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145222834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The harmonious coloring game 和谐的填色游戏
IF 0.6 4区 计算机科学
Information Processing Letters Pub Date : 2026-02-01 Epub Date: 2025-09-25 DOI: 10.1016/j.ipl.2025.106609
Cláudia Linhares Sales , Thiago Marcilon , Nicolas Martins , Nicolas Nisse , Rudini Sampaio
{"title":"The harmonious coloring game","authors":"Cláudia Linhares Sales ,&nbsp;Thiago Marcilon ,&nbsp;Nicolas Martins ,&nbsp;Nicolas Nisse ,&nbsp;Rudini Sampaio","doi":"10.1016/j.ipl.2025.106609","DOIUrl":"10.1016/j.ipl.2025.106609","url":null,"abstract":"<div><div>A harmonious <em>k</em>-coloring of a graph <em>G</em> is a 2-distance proper <em>k</em>-coloring of its vertices such that each edge is uniquely identified by the colors of its endpoints. Here, we introduce its game version: the harmonious coloring game. In this two-player game, Alice and Bob alternately select an uncolored vertex and assigns to it a color in <span><math><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>k</mi><mo>}</mo></math></span> with the constraint that, at every turn, the set of colored vertices induces a valid partial harmonious coloring. Alice wins if all vertices are colored; otherwise, Bob wins. The harmonious game chromatic number <span><math><msub><mrow><mi>χ</mi></mrow><mrow><mi>h</mi><mi>g</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math></span> is the minimum integer <em>k</em> such that Alice has a winning strategy with <em>k</em> colors. In this paper, we prove the PSPACE-hardness of three variants of this game. As a by-product, we prove that a variant introduced by Chen et al. in 1997 of the classical graph coloring game is PSPACE-hard even in graphs with diameter two. We also obtain lower and upper bounds for <span><math><msub><mrow><mi>χ</mi></mrow><mrow><mi>h</mi><mi>g</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math></span> in graph classes, such as paths, cycles, grids and forests of stars.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"192 ","pages":"Article 106609"},"PeriodicalIF":0.6,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145160201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fault-tolerant distributed trigger counting 容错分布式触发器计数
IF 0.6 4区 计算机科学
Information Processing Letters Pub Date : 2026-02-01 Epub Date: 2025-11-04 DOI: 10.1016/j.ipl.2025.106612
Manish Kumar , Manish Kumar
{"title":"Fault-tolerant distributed trigger counting","authors":"Manish Kumar ,&nbsp;Manish Kumar","doi":"10.1016/j.ipl.2025.106612","DOIUrl":"10.1016/j.ipl.2025.106612","url":null,"abstract":"<div><div>In this paper, we address the Fault-Tolerant Distributed Trigger Counting (FTDTC) problem under the presence of crash faults, exploring both <em>explicit</em> and <em>implicit</em> settings. In the <strong>explicit</strong> setting, we aim to count all triggers across the entire network, whereas, in the <strong>implicit</strong> setting, we consider a subset of nodes<span><span><sup>1</sup></span></span> for trigger counting. We investigated the message complexity of FTDTC problem in the crash fault synchronous and fully-connected distributed network. We present randomized (Monte Carlo) algorithms that achieve sublinear and subquadratic message complexity in the socalled implicit version and explicit version, respectively, when tolerating more than a constant fraction of the faulty nodes. Our fault-tolerant distributed trigger counting algorithms are resilient to any number of faulty nodes, up to <span><math><mrow><mo>(</mo><mi>n</mi><mo>−</mo><mi>polylog</mi><mi>n</mi><mo>)</mo></mrow></math></span>.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"192 ","pages":"Article 106612"},"PeriodicalIF":0.6,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145520426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A simple supercritical tradeoff between size and height in resolution 分辨率大小和高度之间的简单超临界权衡
IF 0.7 4区 计算机科学
Information Processing Letters Pub Date : 2026-01-01 Epub Date: 2025-05-19 DOI: 10.1016/j.ipl.2025.106589
Sam Buss , Neil Thapen
{"title":"A simple supercritical tradeoff between size and height in resolution","authors":"Sam Buss ,&nbsp;Neil Thapen","doi":"10.1016/j.ipl.2025.106589","DOIUrl":"10.1016/j.ipl.2025.106589","url":null,"abstract":"<div><div>We describe CNFs in <em>n</em> variables which, over a range of parameters, have small resolution refutations but are such that any small refutation must have height larger than <em>n</em> (even exponential in <em>n</em>), where the height of a refutation is the length of the longest path in it. This is called a <em>supercritical</em> tradeoff between size and height because, if we do not care about size, every CNF is refutable in height <em>n</em>. Our proof method uses a simple construction, based on or-ification and base <em>d</em> representations of integers, to reduce the number of variables. A similar result appeared in [Fleming, Pitassi and Robere, ITCS '22], for different formulas using a more complicated construction for reducing the number of variables.</div><div>Small refutations of our formula are necessarily highly irregular, making it a plausible candidate to separate resolution from pool resolution, which amounts to separating CDCL with restarts from CDCL without restarts. We are not able to show this. In the other direction, we show that a simpler version of our formula, with a similar irregularity property, <em>does</em> have polynomial size pool resolution refutations and thus does not provide such a separation for CDCL.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"191 ","pages":"Article 106589"},"PeriodicalIF":0.7,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144125176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan 具有最小化完工时间预测的非千里眼并行机器调度的更紧边界
IF 0.6 4区 计算机科学
Information Processing Letters Pub Date : 2026-01-01 Epub Date: 2025-08-29 DOI: 10.1016/j.ipl.2025.106598
Tianqi Chen, Zhiyi Tan
{"title":"Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan","authors":"Tianqi Chen,&nbsp;Zhiyi Tan","doi":"10.1016/j.ipl.2025.106598","DOIUrl":"10.1016/j.ipl.2025.106598","url":null,"abstract":"<div><div>This paper investigates the non-clairvoyant parallel machine scheduling problem with prediction, with the objective of minimizing the makespan. Improved lower bounds for the problem and competitive ratios of online algorithms with respect to the prediction error are presented for both the non-preemptive and preemptive cases on <em>m</em> identical machines.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"191 ","pages":"Article 106598"},"PeriodicalIF":0.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144922608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Corrigendum to “On the complexity of co-secure dominating set problem” [Inf. Process. Lett. 185 (2024) 106463] “关于共同安全支配集问题的复杂性”的勘误表[参考文献]。Lett. 185 (2024) 106463]
IF 0.6 4区 计算机科学
Information Processing Letters Pub Date : 2026-01-01 Epub Date: 2025-06-04 DOI: 10.1016/j.ipl.2025.106592
Bhawani Sankar Panda , Soumyashree Rana , Sounaka Mishra
{"title":"Corrigendum to “On the complexity of co-secure dominating set problem” [Inf. Process. Lett. 185 (2024) 106463]","authors":"Bhawani Sankar Panda ,&nbsp;Soumyashree Rana ,&nbsp;Sounaka Mishra","doi":"10.1016/j.ipl.2025.106592","DOIUrl":"10.1016/j.ipl.2025.106592","url":null,"abstract":"<div><div>We correct an error in <span><span>Theorem 4</span></span> in our published paper Panda et al. <span><span>[3]</span></span>.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"191 ","pages":"Article 106592"},"PeriodicalIF":0.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145018711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Rank-2 module-LIP with special matrices 具有特殊矩阵的秩2模lip
IF 0.7 4区 计算机科学
Information Processing Letters Pub Date : 2026-01-01 Epub Date: 2025-06-11 DOI: 10.1016/j.ipl.2025.106593
Manoj Gyawali
{"title":"Rank-2 module-LIP with special matrices","authors":"Manoj Gyawali","doi":"10.1016/j.ipl.2025.106593","DOIUrl":"10.1016/j.ipl.2025.106593","url":null,"abstract":"<div><div>Lattice isomorphism problem (LIP) has been studied since 1990s. In 2023, a post-quantum signature scheme known as HAWK was submitted in the NIST standardization of additional signature scheme, which is based on the module lattice isomorphism problem (module-LIP). Module-LIP was formally defined by Mureau et al. at Eurocrypt'24 and Luo et al. reduced the problem of solving module-LIP over CM number fields to a problem of finding the special type of symplectic automorphism.</div><div>In this paper, we extend this idea further by establishing a reduction of the module-LIP to a problem of finding special types of matrices.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"191 ","pages":"Article 106593"},"PeriodicalIF":0.7,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144270237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Note on pancake sorting 煎饼分拣注意事项
IF 0.6 4区 计算机科学
Information Processing Letters Pub Date : 2026-01-01 Epub Date: 2025-08-29 DOI: 10.1016/j.ipl.2025.106597
Marcin Peczarski
{"title":"Note on pancake sorting","authors":"Marcin Peczarski","doi":"10.1016/j.ipl.2025.106597","DOIUrl":"10.1016/j.ipl.2025.106597","url":null,"abstract":"<div><div>We present generalized approach to the proof of the lower bound for unburnt pancake sorting problem, where we search for the number <span><math><mi>f</mi><mo>(</mo><mi>n</mi><mo>)</mo></math></span> of prefix reversals required to sort a stack (permutation) of <em>n</em> pancakes. For this purpose we introduce a new concept of guarded pancake blocks. Gates and Papadimitriou proved that <span><math><mi>f</mi><mo>(</mo><mi>n</mi><mo>)</mo><mo>≥</mo><mn>17</mn><mi>n</mi><mo>/</mo><mn>16</mn></math></span> for <em>n</em> a multiple of 16. Heydari and Sudborough improved this bound to <span><math><mi>f</mi><mo>(</mo><mi>n</mi><mo>)</mo><mo>≥</mo><mn>15</mn><mi>n</mi><mo>/</mo><mn>14</mn></math></span> for <em>n</em> a multiple of 14. We extend that result to <span><math><mi>f</mi><mo>(</mo><mi>n</mi><mo>)</mo><mo>≥</mo><mo>⌊</mo><mo>(</mo><mn>15</mn><mi>n</mi><mo>+</mo><mn>9</mn><mo>)</mo><mo>/</mo><mn>14</mn><mo>⌋</mo></math></span> for every <span><math><mi>n</mi><mo>≥</mo><mn>6</mn></math></span>.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"191 ","pages":"Article 106597"},"PeriodicalIF":0.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144922609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书