Information and Computation最新文献_第8页

Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs 图行走自动机和星形子图倾斜的空虚性问题的复杂性

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-11-30 DOI: 10.1016/j.ic.2023.105127

Olga Martynova

引用次数: 0

Realizability problem for constraint LTL 约束LTL的可实现性问题

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-11-24 DOI: 10.1016/j.ic.2023.105126

Ashwin Bhaskar, M. Praveen

引用次数: 0

Choosing the right algorithm with hints from complexity theory 从复杂性理论中选择正确的算法

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-11-24 DOI: 10.1016/j.ic.2023.105125

Shouda Wang , Weijie Zheng , Benjamin Doerr

{"title":"Choosing the right algorithm with hints from complexity theory","authors":"Shouda Wang , Weijie Zheng , Benjamin Doerr","doi":"10.1016/j.ic.2023.105125","DOIUrl":"https://doi.org/10.1016/j.ic.2023.105125","url":null,"abstract":"<div>Choosing a suitable algorithm from the myriads of different search heuristics is difficult when faced with a novel optimization problem. In this work, we argue that the purely academic question of what could be the best possible algorithm in a certain broad class of black-box optimizers can give fruitful indications in which direction to search for good established heuristics. We demonstrate this approach on the recently proposed DLB benchmark. Our finding that the unary unbiased black-box complexity is only <math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math> suggests the Metropolis algorithm as an interesting candidate and we prove that it solves the DLB problem in quadratic time. We also prove that better runtimes cannot be obtained in the class of unary unbiased algorithms. We therefore shift our attention to algorithms that use the information of more parents to generate new solutions and find that the significance-based compact genetic algorithm can solve the DLB problem in time <math><mi>O</mi><mo>(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math>.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"296 ","pages":"Article 105125"},"PeriodicalIF":1.0,"publicationDate":"2023-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540123001281/pdfft?md5=8b4268eeef641099a096e9ad52fb7722&pid=1-s2.0-S0890540123001281-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138471961","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}

引用次数: 15

Succinct data structure for path graphs 路径图的简洁数据结构

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-11-20 DOI: 10.1016/j.ic.2023.105124

Girish Balakrishnan , Sankardeep Chakraborty , N.S. Narayanaswamy , Kunihiko Sadakane

{"title":"Succinct data structure for path graphs","authors":"Girish Balakrishnan , Sankardeep Chakraborty , N.S. Narayanaswamy , Kunihiko Sadakane","doi":"10.1016/j.ic.2023.105124","DOIUrl":"https://doi.org/10.1016/j.ic.2023.105124","url":null,"abstract":"<div>We consider the problem of designing a succinct data structure for path graphs, that generalizes interval graphs, on n vertices while efficiently supporting degree, adjacency, and neighbourhood queries. We provide the following two solutions for this problem:<ul><li>1.an <math><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>+</mo><mi>o</mi><mo>(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math>-bit succinct data structure that supports adjacency query in <math><mi>O</mi><mo>(</mo><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math> time, neighbourhood query in <math><mi>O</mi><mo>(</mo><mi>d</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math> time and finally, degree query in <math><mi>min</mi><mo>⁡</mo><mo>{</mo><mi>O</mi><mo>(</mo><msup><mrow><mi>log</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>⁡</mo><mi>n</mi><mo>)</mo><mo>,</mo><mi>O</mi><mo>(</mo><mi>d</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo><mo>}</mo></math> time where d is the degree of the queried vertex.</li><li>2.an <math><mi>O</mi><mo>(</mo><mi>n</mi><msup><mrow><mi>log</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>⁡</mo><mi>n</mi><mo>)</mo></math>-bit space-efficient data structure that supports adjacency, neighborhood, and degree queries optimally.</li></ul> Central to our data structures is the usage of the heavy path decomposition, followed by careful bookkeeping using an orthogonal range search data structure using wavelet trees among others, which may be of independent interest for designing succinct data structures for other graph classes.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"296 ","pages":"Article 105124"},"PeriodicalIF":1.0,"publicationDate":"2023-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138436395","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

Special Issue: Selected papers of the 15th International Conference on Language and Automata Theory and Applications, LATA 2021 特刊:第十五届语言与自动机理论与应用国际会议论文集，LATA 2021

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-11-16 DOI: 10.1016/j.ic.2023.105101

Carlos Martín-Vide , Bianca Truthe

引用次数: 0

Clustering categorical data: Soft rounding k-modes 聚类分类数据:软舍入k模

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-11-15 DOI: 10.1016/j.ic.2023.105115

Surya Teja Gavva, Karthik C. S., Sharath Punna

引用次数: 0

On the codewords of generalized Reed-Muller codes reaching the fourth weight 广义Reed-Muller码的码字达到第四权值

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-11-13 DOI: 10.1016/j.ic.2023.105113

Somayyeh Golalizadeh, Nasrin Soltankhah

引用次数: 0

Early detection of temporal constraint violations 时间约束违规的早期检测

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-11-10 DOI: 10.1016/j.ic.2023.105114

Isaac Mackey, Raghubir Chimni, Jianwen Su

引用次数: 0

Exchange of indivisible goods under matroid constraints 矩阵约束下不可分割物品的交换

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-10-21 DOI: 10.1016/j.ic.2023.105110

Jinshan Zhang , Bo Tang , Jianwei Yin

引用次数: 0

Transduction from trees to graphs through folding 通过折叠从树到图的转换

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-10-21 DOI: 10.1016/j.ic.2023.105111

Martin Berglund , Henrik Björklund , Johanna Björklund , Adrien Boiret

引用次数: 0