Information and Computation最新文献

Computing conforming partitions with low stabbing number for rectilinear polygons 计算直线多边形的低刺数一致性分区

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-01-28 DOI: 10.1016/j.ic.2026.105415

Therese Biedl , Stephane Durocher , Debajyoti Mondal , Rahnuma Islam Nishat , Bastien Rivier

{"title":"Computing conforming partitions with low stabbing number for rectilinear polygons","authors":"Therese Biedl , Stephane Durocher , Debajyoti Mondal , Rahnuma Islam Nishat , Bastien Rivier","doi":"10.1016/j.ic.2026.105415","DOIUrl":"10.1016/j.ic.2026.105415","url":null,"abstract":"<div><div>A <em>conforming partition</em> of a rectilinear <em>n</em>-gon <em>P</em> (possibly with holes) is a partition of <em>P</em> into rectangles without using Steiner points (i.e., all corners of all rectangles must lie on the boundary of <em>P</em>). The stabbing number of such a partition is the maximum number of rectangles intersected by an axis-aligned segment lying in the interior of <em>P</em>. In this paper, we examine the problem of computing conforming partitions with low stabbing number. We show that computing a conforming partition with stabbing number at most 4 is <span><math><mi>NP</mi></math></span>-hard, which strengthens a previously known hardness result [Durocher & Mehrabi, Theor. Comput. Sci. 689: 157-168 (2017)] and eliminates the possibility for fixed-parameter-tractable algorithms parameterized by the stabbing number unless <span><math><mi>P</mi><mo>=</mo><mrow><mi>NP</mi></mrow></math></span>. In contrast, we give (i) an <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span>-time algorithm to decide whether a conforming partition with stabbing number 2 exists, (ii) a fixed-parameter-tractable algorithm parameterized by both the stabbing number and treewidth of the pixel graph of the polygon, and (iii) a fixed-parameter-tractable algorithm parameterized by the stabbing number for polygons without holes in general position.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"309 ","pages":"Article 105415"},"PeriodicalIF":1.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174313","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

Seven kinds of equivalent models for generalized coalition logics 广义联合逻辑的七种等价模型

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-02-03 DOI: 10.1016/j.ic.2026.105419

Zixuan Chen, Fengkui Ju

{"title":"Seven kinds of equivalent models for generalized coalition logics","authors":"Zixuan Chen, Fengkui Ju","doi":"10.1016/j.ic.2026.105419","DOIUrl":"10.1016/j.ic.2026.105419","url":null,"abstract":"<div><div>Coalition Logic is an important logic in the logical study of strategic reasoning. It admits two kinds of semantics: one based on concurrent game models, and the other based on alpha neighborhood models, which capture the alpha powers of coalitions. In two recent papers, Li and Ju argued that, generally, concurrent game models have three assumptions that are too strong: seriality, independence of agents, and determinism. They presented eight coalition logics based on eight classes of general concurrent game models determined by which of the three assumptions are met. In this paper, we show that the set of valid formulas of each of these eight logics can equivalently be characterized by six alternative classes of models, each of which provides a natural and well-motivated representation of coalitional powers: (1) <em>single-coalition-first action models</em>, in which the outcome functions for single coalitions determine the outcome functions for all other coalitions; (2) <em>single-coalition-first actual neighborhood models</em>, in which the neighborhood functions for single coalitions determine the neighborhood functions for all other coalitions; (3) <em>clear grand-coalition-first action models</em>, in which the outcome function for the grand coalition determines the outcome functions for all other coalitions, and distinct joint actions of the grand coalition yield distinct outcomes; (4) <em>clear single-coalition-first actual neighborhood models</em>, in which the actual powers of single coalitions are pairwise disjoint; (5) <em>tree-like grand-coalition-first action models</em>, in which every state has a unique history; and (6) <em>tree-like single-coalition-first actual neighborhood models</em>, in which every state also has a unique history.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"309 ","pages":"Article 105419"},"PeriodicalIF":1.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174310","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 hierarchy of constant communication complexity 不断通信的复杂层次结构

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-01-27 DOI: 10.1016/j.ic.2026.105416

Andris Ambainis , Hartmut Klauck , Debbie Lim

{"title":"A hierarchy of constant communication complexity","authors":"Andris Ambainis , Hartmut Klauck , Debbie Lim","doi":"10.1016/j.ic.2026.105416","DOIUrl":"10.1016/j.ic.2026.105416","url":null,"abstract":"<div><div>Similarly to the Chomsky hierarchy, we offer a classification of communication complexity measures such that these measures are organized into equivalence classes. Different from previous attempts of this endeavour, we consider two communication complexity measures as equivalent, if, when one is constant, then the other is constant as well, and vice versa. Most previous considerations of similar topics have been using polylogarithmic input length as a defining characteristic of equivalence. In this paper, two measures <span><math><msub><mrow><mi>C</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>C</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> are <em>constant-equivalent</em>, if and only if for all total Boolean (families of) functions <span><math><mi>f</mi><mo>:</mo><msup><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></mrow><mrow><mi>n</mi></mrow></msup><mo>×</mo><msup><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></mrow><mrow><mi>n</mi></mrow></msup><mo>→</mo><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></math></span> we have <span><math><msub><mrow><mi>C</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo><mo>=</mo><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span> if and only if <span><math><msub><mrow><mi>C</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo><mo>=</mo><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span>. We identify five equivalence classes according to the above equivalence relation. Interestingly, the classification is counter-intuitive in that powerful models of communication are grouped with weak ones, and seemingly weaker models end up on the top of the hierarchy.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"309 ","pages":"Article 105416"},"PeriodicalIF":1.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174315","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

Applications of littlestone dimension to query learning and to compression littlestone维在查询学习和压缩中的应用

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-02-24 DOI: 10.1016/j.ic.2026.105424

Hunter Chase, James Freitag, Lev Reyzin

引用次数: 0

A practical quantum Hoare logic with classical variables, I 一个具有经典变量的实用量子霍尔逻辑

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-02-02 DOI: 10.1016/j.ic.2026.105417

Mingsheng Ying

{"title":"A practical quantum Hoare logic with classical variables, I","authors":"Mingsheng Ying","doi":"10.1016/j.ic.2026.105417","DOIUrl":"10.1016/j.ic.2026.105417","url":null,"abstract":"<div><div>In this paper, we present a Hoare-style logic for reasoning about quantum programs with classical variables. Our approach offers several improvements over previous work:<ul><li><span>1.</span><span><div><strong><em>Enhanced expressivity of the programming language</em></strong>: Our logic applies to quantum programs with classical variables that incorporate quantum arrays and parameterized quantum gates, which have not been addressed in previous research on quantum Hoare logic, either with or without classical variables.</div></span></li><li><span>2.</span><span><div><strong><em>Intuitive correctness specifications</em></strong>: In our logic, preconditions and postconditions for quantum programs with classical variables are specified as a pair consisting of a classical first-order logical formula and a quantum predicate formula (possibly parameterized by classical variables). These specifications offer greater clarity and align more closely with the programmer's intuitive understanding of quantum and classical interactions.</div></span></li><li><span>3.</span><span><div><strong><em>Simplified proof system</em></strong>: By introducing a novel idea in formulating a proof rule for reasoning about quantum measurements, along with (2), we develop a proof system for quantum programs that requires only minimal modifications to classical Hoare logic. Furthermore, this proof system can be effectively and conveniently combined with classical first-order logic to verify quantum programs with classical variables.</div></span></li></ul> As a result, the learning curve for quantum program verification techniques is significantly reduced for those already familiar with classical program verification techniques, and existing tools for verifying classical programs can be more easily adapted for quantum program verification.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"309 ","pages":"Article 105417"},"PeriodicalIF":1.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174314","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

On Jaffe's pumping lemma, revisited 关于Jaffe的抽气引理，再次回顾

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-02-03 DOI: 10.1016/j.ic.2026.105418

Markus Holzer, Christian Rauch

{"title":"On Jaffe's pumping lemma, revisited","authors":"Markus Holzer, Christian Rauch","doi":"10.1016/j.ic.2026.105418","DOIUrl":"10.1016/j.ic.2026.105418","url":null,"abstract":"<div><div>We consider Jaffe's pumping lemma [<span>J. Jaffe</span>. A necessary and sufficient pumping lemma for regular languages. <em>SIGACT News</em>, Summer, 1978] from a descriptional complexity perspective. Jaffe's pumping lemma is a necessary and sufficient condition for a language for being regular. Building on this, we improve on a result of [<span>A. Yehudai</span>. A note on the pumping lemma for regular languages. <em>Inform. Proc. Lett.</em>, 9(3):135–136, 1979] by proving the existence of a regular language over an alphabet Σ with at least two symbols whose deterministic state complexity lies strictly between <em>p</em>, the minimal pumping constant in Jaffe's lemma, and <span><math><msubsup><mrow><mo>∑</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>p</mi><mo>−</mo><mn>1</mn></mrow></msubsup><mo>|</mo><mi>Σ</mi><msup><mrow><mo>|</mo></mrow><mrow><mi>i</mi></mrow></msup></math></span>. This finding aligns with recent work on minimal pumping constants for various pumping lemmas, as studied in [<span>J. Dassow</span> and <span>I. Jecker</span>. Operational complexity and pumping lemmas. <em>Acta Inform.</em>, 59:337–355, 2022]. We further compare the minimal pumping constant in Jaffe's lemma with those of other well-known pumping lemmata from the literature, demonstrating that, in most cases, these constants can be independently assigned across the different lemmata.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"309 ","pages":"Article 105418"},"PeriodicalIF":1.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174312","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

Bridging computational notions of depth 连接深度的计算概念

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-02-06 DOI: 10.1016/j.ic.2026.105420

Laurent Bienvenu, Christopher P. Porter

{"title":"Bridging computational notions of depth","authors":"Laurent Bienvenu, Christopher P. Porter","doi":"10.1016/j.ic.2026.105420","DOIUrl":"10.1016/j.ic.2026.105420","url":null,"abstract":"<div><div>In this article, we study the relationship between notions of depth for sequences, namely, Bennett's notions of strong and weak depth, and deep <span><math><msubsup><mrow><mi>Π</mi></mrow><mrow><mn>1</mn></mrow><mrow><mn>0</mn></mrow></msubsup></math></span> classes, introduced by the authors and motivated by previous work of Levin. For the first main result of the study, we show that every member of a <span><math><msubsup><mrow><mi>Π</mi></mrow><mrow><mn>1</mn></mrow><mrow><mn>0</mn></mrow></msubsup></math></span> class is order-deep, a property that implies strong depth. From this result, we obtain new examples of strongly deep sequences based on properties studied in computability theory and algorithmic randomness. We further show that not every strongly deep sequence is a member of a deep <span><math><msubsup><mrow><mi>Π</mi></mrow><mrow><mn>1</mn></mrow><mrow><mn>0</mn></mrow></msubsup></math></span> class. For the second main result, we show that the collection of strongly deep sequences is negligible, which is equivalent to the statement that the probability of computing a strongly deep sequence with some randomly drawn oracle is 0, a property also shared by every deep <span><math><msubsup><mrow><mi>Π</mi></mrow><mrow><mn>1</mn></mrow><mrow><mn>0</mn></mrow></msubsup></math></span> class. Finally, we show that variants of strong depth, given in terms of a priori complexity and monotone complexity, are equivalent to weak depth.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"309 ","pages":"Article 105420"},"PeriodicalIF":1.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147422949","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

Collision-resistant hash-shuffles on the reals 在现实中抗碰撞哈希洗牌

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-02-20 DOI: 10.1016/j.ic.2026.105426

George Barmpalias, Xiaoyan Zhang

引用次数: 0

Special issue on selected papers from the 19th International Workshop on Algorithms and Computation (WALCOM 2025) 第19届算法与计算国际研讨会（WALCOM 2025）论文精选特刊

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-02-06 DOI: 10.1016/j.ic.2026.105422

Shin-ichi Nakano , Mingyu Xiao

引用次数: 0

Dichotomy for Holant* problems with one ternary function on domain size 3 域大小为3的一个三元函数的Holant*问题的二分法

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-02-09 DOI: 10.1016/j.ic.2026.105421

Jin-Yi Cai , Pinyan Lu , Mingji Xia

{"title":"Dichotomy for Holant* problems with one ternary function on domain size 3","authors":"Jin-Yi Cai , Pinyan Lu , Mingji Xia","doi":"10.1016/j.ic.2026.105421","DOIUrl":"10.1016/j.ic.2026.105421","url":null,"abstract":"<div><div>Holant problems are a general framework to study the algorithmic complexity of counting problems. Both counting constraint satisfaction problems and graph homomorphisms are special cases. All previous results of Holant problems are over the Boolean domain.<span><span><sup>3</sup></span></span> In this paper, we give the first dichotomy theorem for Holant problems for domain size >2. We discover unexpected tractable families of counting problems, by giving new polynomial time algorithms. This paper also initiates holographic reductions in domains of size >2. This is our main algorithmic technique, and is used for both tractable families and hardness reductions. The dichotomy theorem is the following: For any complex-valued symmetric function <strong>F</strong> with arity 3 on domain size 3, we give an explicit criterion on <strong>F</strong>, such that if <strong>F</strong> satisfies the criterion then the problem <span><math><msup><mrow><mi>Holant</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>(</mo><mi>F</mi><mo>)</mo></math></span> is computable in polynomial time; otherwise <span><math><msup><mrow><mi>Holant</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>(</mo><mi>F</mi><mo>)</mo></math></span> is #P-hard.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"309 ","pages":"Article 105421"},"PeriodicalIF":1.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174309","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