Information Processing Letters最新文献_第3页

A note on the method of equal shares 关于平分法的说明

IF 0.7 4区计算机科学

Information Processing Letters Pub Date : 2025-03-18 DOI: 10.1016/j.ipl.2025.106576

Luis Sánchez-Fernández

引用次数: 0

A note on the complexity of one-sided crossing minimization of trees 关于树的单侧交叉最小化的复杂性的说明

IF 0.7 4区计算机科学

Information Processing Letters Pub Date : 2025-03-18 DOI: 10.1016/j.ipl.2025.106575

Alexander Dobler

引用次数: 0

On the complexity of some restricted variants of Quotient Pigeon and a weak variant of Kőnig 商鸽的一些限制变体和Kőnig的一个弱变体的复杂性

IF 0.7 4区计算机科学

Information Processing Letters Pub Date : 2025-03-10 DOI: 10.1016/j.ipl.2025.106574

Takashi Ishizuka

{"title":"On the complexity of some restricted variants of Quotient Pigeon and a weak variant of Kőnig","authors":"Takashi Ishizuka","doi":"10.1016/j.ipl.2025.106574","DOIUrl":"10.1016/j.ipl.2025.106574","url":null,"abstract":"<div><div>One of the most famous <span>TFNP</span> subclasses is <span>PPP</span>, which is the set of all search problems whose totality is guaranteed by the pigeonhole principle. The author's recent preprint <span><span>[1]</span></span> has introduced a <span>TFNP</span> problem related to the pigeonhole principle over a quotient set, called <span>Quotient Pigeon</span>, and shown that the problem <span>Quotient Pigeon</span> is not only <span>PPP</span>-hard but also <span>PLS</span>-hard. In this paper, we formulate other computational problems related to the pigeonhole principle over a quotient set via an explicit representation of the equivalence classes. Our new formulation introduces a non-trivial <span><math><mtext>PPP</mtext><mo>∩</mo><msub><mrow><mtext>PPA</mtext></mrow><mrow><mi>k</mi></mrow></msub></math></span>-complete problem for every <span><math><mi>k</mi><mo>≥</mo><mn>2</mn></math></span>. Furthermore, we consider the computational complexity of a computational problem related to Kőnig's lemma, which is a weaker variant of the problem formulated by Pasarkar et al. <span><span>[2]</span></span>. We show that our weaker variant is <span>PPAD</span>-hard and is in <span><math><mtext>PPP</mtext><mo>∩</mo><mtext>PPA</mtext></math></span>.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"190 ","pages":"Article 106574"},"PeriodicalIF":0.7,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143601479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Friends-and-strangers is PSPACE-complete 《朋友和陌生人》是完整的pspace

IF 0.7 4区计算机科学

Information Processing Letters Pub Date : 2025-03-03 DOI: 10.1016/j.ipl.2025.106573

Chao Yang , Zhujun Zhang

引用次数: 0

A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees 多无根二叉树上最大一致林的简单4逼近算法

IF 0.7 4区计算机科学

Information Processing Letters Pub Date : 2025-02-28 DOI: 10.1016/j.ipl.2025.106572

Jordan Dempsey , Leo van Iersel , Mark Jones , Norbert Zeh

{"title":"A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees","authors":"Jordan Dempsey , Leo van Iersel , Mark Jones , Norbert Zeh","doi":"10.1016/j.ipl.2025.106572","DOIUrl":"10.1016/j.ipl.2025.106572","url":null,"abstract":"<div><div>Maximum agreement forests have been used as a measure of dissimilarity of two or more phylogenetic trees on a given set of taxa. An agreement forest is a set of trees that can be obtained from each of the input trees by deleting edges and suppressing degree-2 vertices. A maximum agreement forest is such a forest with the minimum number of components. We present a simple 4-approximation algorithm for computing a maximum agreement forest of multiple unrooted binary trees. This algorithm applies LP rounding to an extension of a recent ILP formulation of the maximum agreement forest problem on two trees by Van Wersch et al. <span><span>[13]</span></span>. We achieve the same approximation ratio as the algorithm by Chen et al. <span><span>[3]</span></span>, but our algorithm is extremely simple. We also prove that no algorithm based on the ILP formulation by Van Wersch et al. can achieve an approximation ratio of <span><math><mn>4</mn><mo>−</mo><mi>ε</mi></math></span>, for any <span><math><mi>ε</mi><mo>></mo><mn>0</mn></math></span>, even on two trees. To this end, we prove that the integrality gap of the ILP approaches 4 as the size of the two input trees grows.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"190 ","pages":"Article 106572"},"PeriodicalIF":0.7,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143534765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Lower bound proof for the size of BDDs representing a shifted addition 表示移位加法的bdd大小的下界证明

IF 0.7 4区计算机科学

Information Processing Letters Pub Date : 2025-02-15 DOI: 10.1016/j.ipl.2025.106571

Jan Kleinekathöfer, Alireza Mahzoon, Rolf Drechsler

{"title":"Lower bound proof for the size of BDDs representing a shifted addition","authors":"Jan Kleinekathöfer, Alireza Mahzoon, Rolf Drechsler","doi":"10.1016/j.ipl.2025.106571","DOIUrl":"10.1016/j.ipl.2025.106571","url":null,"abstract":"<div><div><em>Decision Diagrams</em> (DDs) are among the most popular representations for Boolean functions. They are widely used in the synthesis and verification of digital circuits. The size (i.e., number of nodes) and computation time (required time for performing operations) are two important parameters that determine the efficiency of a DD in different applications. It has been proven that some DDs can represent specific functions in polynomial space or perform certain operations in polynomial time. For example, <em>Binary Decision Diagrams</em> (BDDs) are capable of representing a wide variety of functions (e.g. integer addition) in polynomial space with respect to the input size. However, there are also some functions (e.g., integer multiplication) for which the exponential lower-bounds have been proven for the BDD sizes.</div><div>In this paper, we investigate the space complexity of representing an integer addition, where one of the operands is shifted to the right by an arbitrary value. We call this function the shifted addition. This function is widely used in many digital circuits, e.g., floating point adders. We prove that the size of the BDD representing a shifted addition has exponential space complexity with respect to the input size. It is an important step towards clarifying the reasons behind the failure of BDD-based verification and synthesis when they are applied to the circuits containing shifted addition, e.g., floating point adders.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"190 ","pages":"Article 106571"},"PeriodicalIF":0.7,"publicationDate":"2025-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143427877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Faster algorithms and a smaller kernel for Cliques or Trees Vertex Deletion 更快的算法和更小的内核用于小群或树状顶点删除

IF 0.7 4区计算机科学

Information Processing Letters Pub Date : 2025-02-14 DOI: 10.1016/j.ipl.2025.106570

Dekel Tsur

引用次数: 0

Online delay management on a single train line with predictions 带预测的单线列车在线延误管理

IF 0.7 4区计算机科学

Information Processing Letters Pub Date : 2025-02-11 DOI: 10.1016/j.ipl.2025.106569

Daniel Eichhorn, Sven O. Krumke

{"title":"Online delay management on a single train line with predictions","authors":"Daniel Eichhorn, Sven O. Krumke","doi":"10.1016/j.ipl.2025.106569","DOIUrl":"10.1016/j.ipl.2025.106569","url":null,"abstract":"<div><div>The Online Delay Management on a Single Train Line (ODMP) deals with the question at which station a train should wait for delayed passengers, instead of forcing them to take the next train. Waiting at a station increases the delay of all passengers that are already on board, and the goal is to minimize the total passenger delay. An online algorithm learns about the number of delayed passengers at a station only when reaching this station. We study the ODMP with an additional prediction on the future input data, which an online algorithm can utilize. Two desired qualities for online algorithms with prediction are called consistency and robustness, denoting the competitive ratio in case of best and worst prediction respectively. We present a family of algorithms, which uses a hyperparameter <span><math><mi>λ</mi><mo>∈</mo><mo>(</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span> measuring the “doubt” about the given prediction. This allows to achieve <span><math><mo>(</mo><mn>1</mn><mo>+</mo><mi>λ</mi><mo>)</mo></math></span>-consistency and <span><math><mo>(</mo><mn>1</mn><mo>+</mo><mn>1</mn><mo>/</mo><mi>λ</mi><mo>)</mo></math></span>-robustness. Moreover, we provide a lower bound for the trade-off between consistency and robustness for two variously detailed prediction models, showing that our algorithm achieves an asymptotically optimal trade-off for small values of <em>λ</em>.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"190 ","pages":"Article 106569"},"PeriodicalIF":0.7,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143420533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Total variation distance for product distributions is #P-complete 产品分布的总变异距离为# p -完全

IF 0.7 4区计算机科学

Information Processing Letters Pub Date : 2025-01-21 DOI: 10.1016/j.ipl.2025.106560

Arnab Bhattacharyya , Sutanu Gayen , Kuldeep S. Meel , Dimitrios Myrisiotis , A. Pavan , N.V. Vinodchandran

引用次数: 0

On the Tractability Landscape of the Conditional Minisum Approval Voting Rule 论条件最小批准投票规则的可追溯性

IF 0.7 4区计算机科学

Information Processing Letters Pub Date : 2025-01-21 DOI: 10.1016/j.ipl.2025.106561

Georgios Amanatidis , Michael Lampis , Evangelos Markakis , Georgios Papasotiropoulos

引用次数: 0