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

Information and Computation最新文献

筛选
英文 中文
Preface to “Computation over Compressed Data” at DCC 2022
IF 0.8 4区 计算机科学
Information and Computation Pub Date : 2025-01-01 DOI: 10.1016/j.ic.2024.105165
Travis Gagie , Nicola Prezza
{"title":"Preface to “Computation over Compressed Data” at DCC 2022","authors":"Travis Gagie , Nicola Prezza","doi":"10.1016/j.ic.2024.105165","DOIUrl":"10.1016/j.ic.2024.105165","url":null,"abstract":"","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"302 ","pages":"Article 105165"},"PeriodicalIF":0.8,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143152254","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
Fixed-parameter algorithms for Fair Hitting Set problems
IF 0.8 4区 计算机科学
Information and Computation Pub Date : 2025-01-01 DOI: 10.1016/j.ic.2024.105261
Tanmay Inamdar , Lawqueen Kanesh , Madhumita Kundu , Nidhi Purohit , Saket Saurabh
{"title":"Fixed-parameter algorithms for Fair Hitting Set problems","authors":"Tanmay Inamdar ,&nbsp;Lawqueen Kanesh ,&nbsp;Madhumita Kundu ,&nbsp;Nidhi Purohit ,&nbsp;Saket Saurabh","doi":"10.1016/j.ic.2024.105261","DOIUrl":"10.1016/j.ic.2024.105261","url":null,"abstract":"<div><div>Selection of a group of representatives satisfying certain fairness constraints, is a commonly occurring scenario. Motivated by this, we initiate a systematic algorithmic study of a <em>fair</em> version of <span>Hitting Set</span>. In the classical <span>Hitting Set</span> problem, the input is a universe <span><math><mi>U</mi></math></span>, a family <span><math><mi>F</mi></math></span> of subsets of <span><math><mi>U</mi></math></span>, and a non-negative integer <em>k</em>. The goal is to determine whether there exists a subset <span><math><mi>S</mi><mo>⊆</mo><mi>U</mi></math></span> of size <em>k</em> that <em>hits</em> (i.e., intersects) every set in <span><math><mi>F</mi></math></span>. Inspired by several recent works, we formulate a fair version of this problem, as follows. The input additionally contains a family <span><math><mi>B</mi></math></span> of subsets of <span><math><mi>U</mi></math></span>, where each subset in <span><math><mi>B</mi></math></span> can be thought of as the group of elements of the same <em>type</em>. We want to find a set <span><math><mi>S</mi><mo>⊆</mo><mi>U</mi></math></span> of size <em>k</em> that (i) hits all sets of <span><math><mi>F</mi></math></span>, and (ii) does not contain <em>too many</em> elements of each type. We call this problem <span>Fair Hitting Set</span>, and chart out its tractability boundary from both classical as well as multivariate perspective. Our results use a multitude of techniques from parameterized complexity including classical to advanced tools, such as, methods of representative sets for matroids, <span>FO</span> model checking, and a generalization of best known kernel for <span>Hitting Set</span>.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"302 ","pages":"Article 105261"},"PeriodicalIF":0.8,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143152251","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
Nondeterminism and the clique problem
IF 0.8 4区 计算机科学
Information and Computation Pub Date : 2024-12-04 DOI: 10.1016/j.ic.2024.105260
Oded Shmueli
{"title":"Nondeterminism and the clique problem","authors":"Oded Shmueli","doi":"10.1016/j.ic.2024.105260","DOIUrl":"10.1016/j.ic.2024.105260","url":null,"abstract":"<div><div>The Clique problem is known to be NP-Complete and the question whether P=NP is unresolved. This paper examines the relative power of nondeterminism versus determinism in a restricted setting. Specifically, we consider solving the clique problem using non-deterministic and deterministic Turing machines. We impose a (reasonable) format in which a problem instance is encoded. We also impose constraints on the computation of both deterministic and non-deterministic Turing machines: both have two tapes, the input tape is read-only and one-way, and once a certain <em>stop point</em> in the input tape is reached, no additional writing on the work tape is allowed. We consider two cases for the position of the stop point: immediately after the number of graph nodes and the size of the clique are specified, or controlled by a parameter <em>q</em> that indicates what portion of the graph nodes' edge specifications have been scanned. The parameter <em>q</em> may be arbitrarily close to 1, e.g., <span><math><mi>q</mi><mo>=</mo><mn>0.99999</mn></math></span>. We show, for both cases in our setting, that a non-deterministic Turing machine can solve the problem in <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>)</mo></math></span> time whereas no deterministic Turing machine can solve the problem in polynomial time. However, we exhibit an exponential time deterministic single work tape, two-heads Turing machine that solves the clique problem in our setting.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105260"},"PeriodicalIF":0.8,"publicationDate":"2024-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143100141","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
Reasoning about group responsibility for exceeding risk threshold in one-shot games
IF 0.8 4区 计算机科学
Information and Computation Pub Date : 2024-11-28 DOI: 10.1016/j.ic.2024.105257
Maksim Gladyshev , Natasha Alechina , Mehdi Dastani , Dragan Doder
{"title":"Reasoning about group responsibility for exceeding risk threshold in one-shot games","authors":"Maksim Gladyshev ,&nbsp;Natasha Alechina ,&nbsp;Mehdi Dastani ,&nbsp;Dragan Doder","doi":"10.1016/j.ic.2024.105257","DOIUrl":"10.1016/j.ic.2024.105257","url":null,"abstract":"<div><div>Tracing and analysing the responsibility for unsafe outcomes of actors' decisions in multi-agent settings have been studied in recent years. These studies often focus on deterministic scenarios and assume that the unsafe outcomes for which actors can be held responsible are actually realized. This paper considers a broader notion of responsibility where unsafe outcomes are not necessarily realized, but their probabilities are unacceptably high. We present a logic combining strategic, probabilistic and temporal primitives designed to express concepts such as the risk of an undesirable outcome and being responsible for exceeding a risk threshold in one-shot games. We demonstrate that the proposed logic is (weakly) complete, decidable and has an efficient model-checking procedure. Finally, we define a probabilistic notion of responsibility and study its formal properties in the proposed logic setting.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105257"},"PeriodicalIF":0.8,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143156628","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
An algebraic attack on the key exchange protocol based upon a modified tropical structure 基于改进的热带结构的密钥交换协议的代数攻击
IF 0.8 4区 计算机科学
Information and Computation Pub Date : 2024-11-28 DOI: 10.1016/j.ic.2024.105259
J. Jackson, R. Perumal
{"title":"An algebraic attack on the key exchange protocol based upon a modified tropical structure","authors":"J. Jackson,&nbsp;R. Perumal","doi":"10.1016/j.ic.2024.105259","DOIUrl":"10.1016/j.ic.2024.105259","url":null,"abstract":"<div><div>In this paper, we analyze the key exchange protocol based on an algebraic structure derived from a tropical semiring. The security of this key exchange scheme depends on an attacker's inability to solve a system of non-linear equations to obtain the private parameters. However, we propose an algebraic attack on this key exchange scheme using only the public parameters. We thoroughly evaluate the protocol's security against algebraic attacks through comprehensive cryptanalysis. We study the behavior of matrix sequences produced during key exchange, looking for any almost linear periodicity property that could affect the cryptanalysis. We provide the algorithm and an example to illustrate our attack, demonstrating that this key exchange protocol is not secure. Additionally, we examine how different parameter selections and matrix sizes impact the protocol's security. Ultimately, this cryptanalysis enhances tropical cryptography by expanding our understanding of the security implications of modified tropical semiring-based key exchange protocols.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105259"},"PeriodicalIF":0.8,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142759453","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
Extending CL-reducibility on array noncomputable degrees
IF 0.8 4区 计算机科学
Information and Computation Pub Date : 2024-11-28 DOI: 10.1016/j.ic.2024.105258
Nan Fang , Wolfgang Merkle
{"title":"Extending CL-reducibility on array noncomputable degrees","authors":"Nan Fang ,&nbsp;Wolfgang Merkle","doi":"10.1016/j.ic.2024.105258","DOIUrl":"10.1016/j.ic.2024.105258","url":null,"abstract":"<div><div>Given a function <em>f</em>, <em>f</em>-bounded-Turing (<em>f</em>-bT-) reducibility is the Turing reducibility with use function bounded by <em>f</em>. In the special case where <span><math><mi>f</mi><mo>=</mo><mrow><mi>id</mi></mrow><mo>+</mo><mi>c</mi></math></span> (with id being the identity function and <em>c</em> a constant), this is referred to as cl-reducibility. In a work by Barmpalias, Fang, and Lewis-Pye, it was proven that there exist two left-c.e. reals such that no left-c.e. real <span><math><mo>(</mo><mrow><mi>id</mi></mrow><mo>+</mo><mi>g</mi><mo>)</mo></math></span>-bT-computes both of them whenever <em>g</em> is computable, nondecreasing, and satisfies <span><math><msub><mrow><mo>∑</mo></mrow><mrow><mi>n</mi></mrow></msub><msup><mrow><mn>2</mn></mrow><mrow><mo>−</mo><mi>g</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow></msup><mo>=</mo><mo>∞</mo></math></span>. Moreover, such maximal pairs exist precisely within every array noncomputable degree. This result generalizes a prior result on cl-reducibility, which states that there exist two left-c.e. reals such that no left-c.e. real cl-computes both of them. An open question remained as to whether a similar extension could apply to another result on cl-reducibility, which asserts that there exists a left-c.e. real not cl-reducible to any random left-c.e. real. We answer this question affirmatively, providing a simpler proof compared to previous works. Additionally, we streamline the proof of the initial extension.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105258"},"PeriodicalIF":0.8,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143100143","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
Probabilistic judgment aggregation with conditional independence constraints
IF 0.8 4区 计算机科学
Information and Computation Pub Date : 2024-11-28 DOI: 10.1016/j.ic.2024.105256
Magdalena Ivanovska , Marija Slavkovik
{"title":"Probabilistic judgment aggregation with conditional independence constraints","authors":"Magdalena Ivanovska ,&nbsp;Marija Slavkovik","doi":"10.1016/j.ic.2024.105256","DOIUrl":"10.1016/j.ic.2024.105256","url":null,"abstract":"<div><div>Probabilistic judgment aggregation is concerned with aggregating judgments about probabilities of logically related issues. It takes as input imprecise probabilistic judgments over the issues given by a group of agents and defines rules of aggregating the individual judgments into a collective opinion representative for the group. The process of aggregation can be subject to constraints, i.e., aggregation rules can be required to satisfy certain properties. We explore how probabilistic independence constraints can be represented and incorporated into the aggregation process.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105256"},"PeriodicalIF":0.8,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143100142","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
ltlf synthesis under environment specifications for reachability and safety properties
IF 0.8 4区 计算机科学
Information and Computation Pub Date : 2024-11-28 DOI: 10.1016/j.ic.2024.105255
Benjamin Aminof , Giuseppe De Giacomo , Antonio Di Stasio , Hugo Francon , Sasha Rubin , Shufang Zhu
{"title":"ltlf synthesis under environment specifications for reachability and safety properties","authors":"Benjamin Aminof ,&nbsp;Giuseppe De Giacomo ,&nbsp;Antonio Di Stasio ,&nbsp;Hugo Francon ,&nbsp;Sasha Rubin ,&nbsp;Shufang Zhu","doi":"10.1016/j.ic.2024.105255","DOIUrl":"10.1016/j.ic.2024.105255","url":null,"abstract":"<div><div>In this paper, we study <span>ltl</span><sub><em>f</em></sub> synthesis under environment specifications for arbitrary reachability and safety properties. We consider both kinds of properties for both agent tasks and environment specifications, providing a complete landscape of synthesis algorithms. For each case, we devise a specific algorithm (optimal wrt complexity of the problem) and prove its correctness. The algorithms combine common building blocks in different ways. While some cases are already studied in literature others are studied here for the first time.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105255"},"PeriodicalIF":0.8,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143100144","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
Distributed fractional local ratio and independent set approximation 分布式分数局部比率和独立集近似值
IF 0.8 4区 计算机科学
Information and Computation Pub Date : 2024-11-22 DOI: 10.1016/j.ic.2024.105238
Magnús M. Halldórsson , Dror Rawitz
{"title":"Distributed fractional local ratio and independent set approximation","authors":"Magnús M. Halldórsson ,&nbsp;Dror Rawitz","doi":"10.1016/j.ic.2024.105238","DOIUrl":"10.1016/j.ic.2024.105238","url":null,"abstract":"<div><div>We consider the <span>Maximum Weight Independent Set</span> problem, with a focus on obtaining good approximations for graphs of small maximum degree Δ. We give deterministic local algorithms running in time <span><math><mi>poly</mi><mo>(</mo><mi>Δ</mi><mo>,</mo><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span> that come close to matching the best centralized results known and improve the previous distributed approximations by a factor of about 2. More precisely, we obtain approximations below <span><math><mfrac><mrow><mi>Δ</mi><mo>+</mo><mn>1</mn><mo>/</mo><mn>2</mn></mrow><mrow><mn>2</mn></mrow></mfrac></math></span>, and a further improvement to <span><math><mn>8</mn><mo>/</mo><mn>5</mn><mo>+</mo><mi>ε</mi></math></span> when <span><math><mi>Δ</mi><mo>=</mo><mn>3</mn></math></span>.</div><div>Technically, this is achieved by leveraging the <em>fractional local ratio</em> technique, for a first application in a distributed setting.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105238"},"PeriodicalIF":0.8,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142723840","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 parallel algorithm for counting parse trees 解析树计数并行算法
IF 0.8 4区 计算机科学
Information and Computation Pub Date : 2024-11-19 DOI: 10.1016/j.ic.2024.105237
Margarita Mikhelson, Alexander Okhotin
{"title":"A parallel algorithm for counting parse trees","authors":"Margarita Mikhelson,&nbsp;Alexander Okhotin","doi":"10.1016/j.ic.2024.105237","DOIUrl":"10.1016/j.ic.2024.105237","url":null,"abstract":"<div><div>A parallel algorithm for computing the number of parse trees of a given string according to a fixed context-free grammar is defined. More generally, the algorithm applies to computing the weight of a string in a weighted grammar over any semiring. The algorithm is first implemented on an arithmetic circuit of depth at most <span><math><mn>6</mn><msup><mrow><mo>(</mo><msub><mrow><mi>log</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⁡</mo><mi>n</mi><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><mi>O</mi><mo>(</mo><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span> and with <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>6</mn></mrow></msup><mo>)</mo></math></span> elements, where the constant factors in the big-O notation depend on the grammar. Then, the circuit is improved using fast matrix multiplication to use only <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>5.38</mn></mrow></msup><mo>)</mo></math></span> elements, while preserving depth <span><math><mi>O</mi><mo>(</mo><msup><mrow><mo>(</mo><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span>.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105237"},"PeriodicalIF":0.8,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142723839","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学术文献互助群
群 号：481959085
Book学术官方微信