Information and Computation最新文献_第2页

Logical equivalences, homomorphism indistinguishability, and forbidden minors 逻辑等价、同构无差别和禁止未成年人

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-09-10 DOI: 10.1016/j.ic.2024.105224

Tim Seppelt

{"title":"Logical equivalences, homomorphism indistinguishability, and forbidden minors","authors":"Tim Seppelt","doi":"10.1016/j.ic.2024.105224","DOIUrl":"10.1016/j.ic.2024.105224","url":null,"abstract":"<div>Two graphs G and H are homomorphism indistinguishable over a graph class <math><mi>F</mi></math> if for all graphs <math><mi>F</mi><mo>∈</mo><mi>F</mi></math> the number of homomorphisms from F to G is equal to the number of homomorphisms from F to H. Many graph isomorphism relaxations such as (quantum) isomorphism, spectral, and logical equivalences can be characterised as homomorphism indistinguishability relations over certain graph classes.Abstracting from the wealth of such instances, we show in this paper that equivalences w.r.t. any self-complementarity logic admitting a characterisation as homomorphism indistinguishability relation can be characterised by homomorphism indistinguishability over a minor-closed graph class. Self-complementarity is a mild property satisfied by most well-studied logics.Furthermore, we classify all graph classes which are in a sense finite and satisfy the maximality condition of being homomorphism distinguishing closed, i.e. adding any graph to the class strictly refines its homomorphism indistinguishability relation. Thereby, we answer various questions raised by Roberson (2022) on properties of the homomorphism distinguishing closure.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105224"},"PeriodicalIF":0.8,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540124000890/pdfft?md5=8f37aee0808075f72c988f0ff4dd0e3d&pid=1-s2.0-S0890540124000890-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142171722","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

Multivariate to bivariate reduction for noncommutative polynomial factorization 非交换多项式因式分解的多变量到双变量还原

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-09-10 DOI: 10.1016/j.ic.2024.105223

V. Arvind , Pushkar S. Joglekar

{"title":"Multivariate to bivariate reduction for noncommutative polynomial factorization","authors":"V. Arvind , Pushkar S. Joglekar","doi":"10.1016/j.ic.2024.105223","DOIUrl":"10.1016/j.ic.2024.105223","url":null,"abstract":"<div>Based on Bergman's theorem, we show that multivariate noncommutative polynomial factorization is deterministic polynomial-time reducible to the factorization of bivariate noncommutative polynomials. More precisely,<ul><li>1.Given an n-variate noncommutative polynomial <math><mi>f</mi><mo>∈</mo><mi>F</mi><mo>〈</mo><mi>X</mi><mo>〉</mo></math> over a field <math><mi>F</mi></math> as an arithmetic circuit, computing a complete factorization of f into irreducible factors is deterministic polynomial-time reducible to factorization of a noncommutative bivariate polynomial <math><mi>g</mi><mo>∈</mo><mi>F</mi><mo>〈</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>〉</mo></math>; the reduction transforms f into a circuit for g, and given a complete factorization of g, the reduction recovers a complete factorization of f in polynomial time.The reduction works both in the white-box and the black-box setting.</li><li>2.We show over the field of rationals that bivariate linear matrix factorization problem for <math><mn>4</mn><mo>×</mo><mn>4</mn></math> matrices is at least as hard as factoring square-free integers and for <math><mn>3</mn><mo>×</mo><mn>3</mn></math> matrices it is in polynomial time.</li></ul></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105223"},"PeriodicalIF":0.8,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142239732","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

Entropic risk for turn-based stochastic games 回合制随机游戏的熵风险

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-14 DOI: 10.1016/j.ic.2024.105214

Christel Baier , Krishnendu Chatterjee , Tobias Meggendorfer , Jakob Piribauer

引用次数: 0

Detecting causality in the presence of Byzantine processes: The case of synchronous systems 在拜占庭进程中检测因果关系：同步系统案例

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-12 DOI: 10.1016/j.ic.2024.105212

Anshuman Misra, Ajay D. Kshemkalyani

{"title":"Detecting causality in the presence of Byzantine processes: The case of synchronous systems","authors":"Anshuman Misra, Ajay D. Kshemkalyani","doi":"10.1016/j.ic.2024.105212","DOIUrl":"10.1016/j.ic.2024.105212","url":null,"abstract":"<div>Detecting causality or the “happens before” relation between events in a distributed system is a fundamental building block for distributed applications. It was recently proved that this problem cannot be solved in an asynchronous distributed system in the presence of Byzantine processes, irrespective of whether the communication mechanism is via unicasts, multicasts, or broadcasts. In light of this impossibility result, we turn attention to synchronous systems and examine the possibility of solving the causality detection problem in such systems. In this paper, we prove that causality detection between events can be solved in the presence of Byzantine processes in a synchronous distributed system. We prove the result by providing two algorithms. The first algorithm uses the Replicated State Machine (RSM) approach and vector clocks. The second algorithm is round-based and uses matrix clocks. The RSM-based algorithm can also run deterministically in partially synchronous systems.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105212"},"PeriodicalIF":0.8,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540124000774/pdfft?md5=0d87e39be95d1a37d231fdd1582347b0&pid=1-s2.0-S0890540124000774-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142020421","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

Weighted automata and logics meet computational complexity 加权自动机和逻辑满足计算复杂性

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-12 DOI: 10.1016/j.ic.2024.105213

Peter Kostolányi

{"title":"Weighted automata and logics meet computational complexity","authors":"Peter Kostolányi","doi":"10.1016/j.ic.2024.105213","DOIUrl":"10.1016/j.ic.2024.105213","url":null,"abstract":"<div>Complexity classes such as <math><mi>#</mi><mi>P</mi></math>, <math><mo>⊕</mo><mi>P</mi></math>, GapP, OptP, NPMV, or the class of fuzzy languages realised by polynomial-time fuzzy nondeterministic Turing machines, can all be described in terms of a class <math><mrow><mi>NP</mi></mrow><mo>[</mo><mi>S</mi><mo>]</mo></math> for a suitable semiring S, defined via weighted Turing machines over S similarly as NP is defined in the unweighted setting. Other complexity classes can be lifted to the quantitative world as well, the resulting classes relating to the original ones in the same way as weighted automata or logics relate to their unweighted counterparts. The article surveys these too-little-known connexions implicit in the existing literature and suggests a systematic approach to the study of weighted complexity classes. An extension of <math><mi>SAT</mi></math> to weighted propositional logic is proved to be complete for <math><mrow><mi>NP</mi></mrow><mo>[</mo><mi>S</mi><mo>]</mo></math> when S is finitely generated. Moreover, a class <math><mrow><mi>FP</mi></mrow><mo>[</mo><mi>S</mi><mo>]</mo></math> is introduced for each semiring S as a counterpart to P, and the relations between <math><mrow><mi>FP</mi></mrow><mo>[</mo><mi>S</mi><mo>]</mo></math> and <math><mrow><mi>NP</mi></mrow><mo>[</mo><mi>S</mi><mo>]</mo></math> are considered.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105213"},"PeriodicalIF":0.8,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141993489","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

Modification problems toward proper (Helly) circular-arc graphs 面向适当（赫利）圆弧图的修改问题

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-05 DOI: 10.1016/j.ic.2024.105211

Yixin Cao , Hanchun Yuan , Jianxin Wang

引用次数: 0

Neural-symbolic temporal decision trees for multivariate time series classification 用于多元时间序列分类的神经符号时间决策树

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-02 DOI: 10.1016/j.ic.2024.105209

Giovanni Pagliarini , Simone Scaboro , Giuseppe Serra , Guido Sciavicco , Ionel Eduard Stan

{"title":"Neural-symbolic temporal decision trees for multivariate time series classification","authors":"Giovanni Pagliarini , Simone Scaboro , Giuseppe Serra , Guido Sciavicco , Ionel Eduard Stan","doi":"10.1016/j.ic.2024.105209","DOIUrl":"10.1016/j.ic.2024.105209","url":null,"abstract":"<div>Multivariate time series classification is an ubiquitous and widely studied problem. Due to their strong generalization capability, neural networks are suitable for this problem, but their intrinsic black-box nature often limits their applicability. Temporal decision trees are a relevant alternative to neural networks for the same task regarding classification performances while attaining higher levels of transparency and interpretability. In this work, we approach the problem of hybridizing these two techniques, and present three independent, natural hybridization solutions to study if, and in what measure, both the ability of neural networks to capture complex temporal patterns and the transparency and flexibility of temporal decision trees can be leveraged. To this end, we provide initial experimental results for several tasks in a binary classification setting, showing that our proposed neural-symbolic hybridization schemata may be a step towards accurate and interpretable models.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105209"},"PeriodicalIF":0.8,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540124000749/pdfft?md5=aee9f730063439e214c71730ad5c92be&pid=1-s2.0-S0890540124000749-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944895","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

State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages 交换正则表达式语言上的投影、洗牌、上下闭合和内部的状态复杂性边界

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-02 DOI: 10.1016/j.ic.2024.105204

Stefan Hoffmann

{"title":"State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages","authors":"Stefan Hoffmann","doi":"10.1016/j.ic.2024.105204","DOIUrl":"10.1016/j.ic.2024.105204","url":null,"abstract":"<div><div>We consider the state complexity of projection, shuffle, up- and downward closure and interior on commutative regular languages. We deduce the state complexity bound <math><msup><mrow><mi>n</mi></mrow><mrow><mo>|</mo><mi>Σ</mi><mo>|</mo></mrow></msup></math> for upward closure and downward interior, and <math><msup><mrow><mo>(</mo><mn>2</mn><mi>n</mi><mi>m</mi><mo>)</mo></mrow><mrow><mo>|</mo><mi>Σ</mi><mo>|</mo></mrow></msup></math>, <math><msup><mrow><mo>(</mo><mi>n</mi><mi>m</mi><mo>)</mo></mrow><mrow><mo>|</mo><mi>Σ</mi><mo>|</mo></mrow></msup></math>, <math><msup><mrow><mo>(</mo><mi>n</mi><mo>+</mo><mi>m</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>|</mo><mi>Σ</mi><mo>|</mo></mrow></msup></math> and <math><msup><mrow><mo>(</mo><mi>n</mi><mo>+</mo><mi>m</mi><mo>−</mo><mn>2</mn><mo>)</mo></mrow><mrow><mo>|</mo><mi>Σ</mi><mo>|</mo></mrow></msup></math> for the shuffle on commutative regular, group, aperiodic and finite languages, respectively, with state complexities n and m over the alphabet Σ. We do not know whether these bounds are sharp. For projection, downward closure and upward interior, we give the sharp bound n. Our results are obtained by using the index and period vectors of a regular language, which we introduce in the present work and investigate w.r.t. the above operations and also union and intersection. Furthermore, we characterize the commutative aperiodic and commutative group languages in terms of these parameters and prove that a commutative regular language equals a finite union of shuffle products of commutative finite and commutative group languages.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105204"},"PeriodicalIF":0.8,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142416802","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

Symbolic computation in algebra, geometry, and differential equations 代数、几何和微分方程中的符号计算

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-02 DOI: 10.1016/j.ic.2024.105200

Franz Winkler

引用次数: 0

Total (restrained) domination in unit disk graphs 单位磁盘图中的完全（受约束）支配

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-02 DOI: 10.1016/j.ic.2024.105210

Yu Yang , Cai-Xia Wang , Shou-Jun Xu

引用次数: 0