关于 k 限制问题的说明

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Processing Letters Pub Date : 2024-06-03 DOI:10.1016/j.ipl.2024.106515

Jing-You Lin, Shi-Chun Tsai

{"title":"关于 k 限制问题的说明","authors":"Jing-You Lin, Shi-Chun Tsai","doi":"10.1016/j.ipl.2024.106515","DOIUrl":null,"url":null,"abstract":"<div>Consider a set of demands, each taking length-k strings as input. The k-restriction problem is to construct a small set of length-m strings, such that given any k positions and any demand, there exists a string in the set satisfying the demand at these positions. The k-restriction problem relates to many problems, such as k-independent sets, covering arrays, and many other combinatorial applications. By considering the VC-dimension of demands, we prove bounds independent of the number of demands with the Lovász Local Lemma. As a result, we can prove better bounds for demands with finite VC-dimension.</div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"187 ","pages":"Article 106515"},"PeriodicalIF":0.7000,"publicationDate":"2024-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A note on the k-restriction problem\",\"authors\":\"Jing-You Lin, Shi-Chun Tsai\",\"doi\":\"10.1016/j.ipl.2024.106515\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>Consider a set of demands, each taking length-k strings as input. The k-restriction problem is to construct a small set of length-m strings, such that given any k positions and any demand, there exists a string in the set satisfying the demand at these positions. The k-restriction problem relates to many problems, such as k-independent sets, covering arrays, and many other combinatorial applications. By considering the VC-dimension of demands, we prove bounds independent of the number of demands with the Lovász Local Lemma. As a result, we can prove better bounds for demands with finite VC-dimension.</div>\",\"PeriodicalId\":56290,\"journal\":{\"name\":\"Information Processing Letters\",\"volume\":\"187 \",\"pages\":\"Article 106515\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-06-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Processing Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020019024000450\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019024000450","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

考虑一组输入长度为 k 的字符串的需求。k 限制问题就是构造一个长度为 m 的字符串小集合，使得在任意 k 个位置和任意需求下，集合中都有一个字符串满足这些位置上的需求。k-restriction 问题与许多问题有关，如 k-independent 集、覆盖数组和许多其他组合应用。通过考虑需求的 VC 维度，我们利用 Lovász Local Lemma 证明了与需求数量无关的边界。因此，我们可以为具有有限 VC 维度的需求证明更好的边界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A note on the k-restriction problem

Consider a set of demands, each taking length-k strings as input. The k-restriction problem is to construct a small set of length-m strings, such that given any k positions and any demand, there exists a string in the set satisfying the demand at these positions. The k-restriction problem relates to many problems, such as k-independent sets, covering arrays, and many other combinatorial applications. By considering the VC-dimension of demands, we prove bounds independent of the number of demands with the Lovász Local Lemma. As a result, we can prove better bounds for demands with finite VC-dimension.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.

期刊最新文献

On the Tractability Landscape of the Conditional Minisum Approval Voting Rule Total variation distance for product distributions is #P-complete A lower bound for the Quickhull convex hull algorithm that disproves the Quickhull precision conjecture String searching with mismatches using AVX2 and AVX-512 instructions On approximate reconfigurability of label cover