Information and Computation最新文献_第5页

Perspective on complexity measures targeting read-once branching programs 以只读分支程序为目标的复杂性测量透视

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-10-15 DOI: 10.1016/j.ic.2024.105230

Yaqiao Li , Pierre McKenzie

引用次数: 0

Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions 随机策略中的不同招数：在有限记忆假设下重温库恩定理

IF 0.8 4区计算机科学

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

James C.A. Main , Mickael Randour

{"title":"Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions","authors":"James C.A. Main , Mickael Randour","doi":"10.1016/j.ic.2024.105229","DOIUrl":"10.1016/j.ic.2024.105229","url":null,"abstract":"<div><div>Two-player (antagonistic) games on (possibly stochastic) graphs are a prevalent model in theoretical computer science, notably as a framework for reactive synthesis.</div><div>Optimal strategies may require randomisation when dealing with inherently probabilistic goals, balancing multiple objectives, or in contexts of partial information. There is no unique way to define randomised strategies. For instance, one can use so-called mixed strategies or behavioural ones. In the most general setting, these two classes do not share the same expressiveness. A seminal result in game theory — Kuhn's theorem — asserts their equivalence in games of perfect recall.</div><div>This result crucially relies on the possibility for strategies to use infinite memory, i.e., unlimited knowledge of all past observations. However, computer systems are finite in practice. Hence it is pertinent to restrict our attention to finite-memory strategies, defined as automata with outputs. Randomisation can be implemented in these in different ways: the initialisation, outputs or transitions can be randomised or deterministic respectively. Depending on which aspects are randomised, the expressiveness of the corresponding class of finite-memory strategies differs.</div><div>In this work, we study two-player concurrent stochastic games and provide a complete taxonomy of the classes of finite-memory strategies obtained by varying which of the three aforementioned components are randomised. Our taxonomy holds in games of perfect and imperfect information with perfect recall, and in games with more than two players. We also provide an adapted taxonomy for games with imperfect recall.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105229"},"PeriodicalIF":0.8,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142441057","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

Predictive mining of multi-temporal relations 多时空关系的预测性挖掘

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-10-03 DOI: 10.1016/j.ic.2024.105228

Beatrice Amico, Carlo Combi, Romeo Rizzi, Pietro Sala

引用次数: 0

Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths 通过矩阵乘法开辟道路：非最短诱导路径的更快算法

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-09-27 DOI: 10.1016/j.ic.2024.105227

Yung-Chung Chiu, Hsueh-I Lu

{"title":"Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths","authors":"Yung-Chung Chiu, Hsueh-I Lu","doi":"10.1016/j.ic.2024.105227","DOIUrl":"10.1016/j.ic.2024.105227","url":null,"abstract":"<div><div>For vertices u and v of an n-vertex graph G, a uv-trail of G is an induced uv-path of G that is not a shortest uv-path of G. Berger, Seymour, and Spirkl [Discrete Mathematics 2021] gave the previously only known polynomial-time algorithm, running in <math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>18</mn></mrow></msup><mo>)</mo></math> time, to either output a uv-trail of G or ensure that G admits no uv-trail. We reduce the complexity to the time required to perform a poly-logarithmic number of multiplications of <math><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>×</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup></math> Boolean matrices, leading to a largely improved <math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>4.75</mn></mrow></msup><mo>)</mo></math>-time algorithm. Our result improves the previous <math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>21</mn></mrow></msup><mo>)</mo></math>-time algorithm by Cook, Horsfield, Preissmann, Robin, Seymour, Sintiari, Trotignon, and Vušković [Journal of Combinatorial Theory, Series B, 2024] for recognizing graphs with all holes the same length, and reduces the running time to <math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>7.75</mn></mrow></msup><mo>)</mo></math>.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105227"},"PeriodicalIF":0.8,"publicationDate":"2024-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142359381","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

Truthful and privacy-preserving generalized linear models 真实和保护隐私的广义线性模型

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-09-12 DOI: 10.1016/j.ic.2024.105225

Yuan Qiu , Jinyan Liu , Di Wang

{"title":"Truthful and privacy-preserving generalized linear models","authors":"Yuan Qiu , Jinyan Liu , Di Wang","doi":"10.1016/j.ic.2024.105225","DOIUrl":"10.1016/j.ic.2024.105225","url":null,"abstract":"<div>This paper explores estimating Generalized Linear Models (GLMs) when agents are strategic and privacy-conscious. We aim to design mechanisms that encourage truthful reporting, protect privacy, and ensure outputs are close to the true parameters. Initially, we address models with sub-Gaussian covariates and heavy-tailed responses with finite fourth moments, proposing a novel private, closed-form estimator. Our mechanism features: (1) <math><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></math>-joint differential privacy with high probability; (2) <math><mi>o</mi><mo>(</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mi>n</mi></mrow></mfrac><mo>)</mo></math>-approximate Bayes Nash equilibrium for <math><mo>(</mo><mn>1</mn><mo>−</mo><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo><mo>)</mo></math>-fraction of agents; (3) <math><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></math> error in parameter estimation; (4) individual rationality for <math><mo>(</mo><mn>1</mn><mo>−</mo><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo><mo>)</mo></math> of agents; (5) <math><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></math> payment budget. We then extend our approach to linear regression with heavy-tailed data, using an <math><msub><mrow><mi>ℓ</mi></mrow><mrow><mn>4</mn></mrow></msub></math>-norm shrinkage operator to propose a similar estimator and payment scheme.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105225"},"PeriodicalIF":0.8,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142171721","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

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