弱平衡多分支 AND-OR 树的最优随机算法

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2024-05-10 DOI:10.1016/j.ipl.2024.106512

Fuki Ito

{"title":"弱平衡多分支 AND-OR 树的最优随机算法","authors":"Fuki Ito","doi":"10.1016/j.ipl.2024.106512","DOIUrl":null,"url":null,"abstract":"<div><p>This article treats AND-OR tree computation in terms of query complexity. We are interested in the cases where assignments (inputs) or algorithms are randomized. For the former case, it is known that there is a unique randomized assignment achieving the distributional complexity of balanced trees. On the other hand, the dual problem has the opposite result; the optimal randomized algorithms for balanced trees are not unique. We extend the latter study on randomized algorithms to weakly-balanced trees, and see that the uniqueness still fails.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"187 ","pages":"Article 106512"},"PeriodicalIF":0.7000,"publicationDate":"2024-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal randomized algorithms of weakly-balanced multi-branching AND-OR trees\",\"authors\":\"Fuki Ito\",\"doi\":\"10.1016/j.ipl.2024.106512\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This article treats AND-OR tree computation in terms of query complexity. We are interested in the cases where assignments (inputs) or algorithms are randomized. For the former case, it is known that there is a unique randomized assignment achieving the distributional complexity of balanced trees. On the other hand, the dual problem has the opposite result; the optimal randomized algorithms for balanced trees are not unique. We extend the latter study on randomized algorithms to weakly-balanced trees, and see that the uniqueness still fails.</p></div>\",\"PeriodicalId\":56290,\"journal\":{\"name\":\"Information Processing Letters\",\"volume\":\"187 \",\"pages\":\"Article 106512\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-05-10\",\"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/S0020019024000425\",\"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/S0020019024000425","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

本文从查询复杂度的角度讨论 AND-OR 树计算。我们感兴趣的是赋值（输入）或算法随机化的情况。对于前一种情况，我们知道有一个唯一的随机赋值可以达到平衡树的分布复杂度。另一方面，对偶问题的结果恰恰相反；平衡树的最优随机算法并不是唯一的。我们将后一项关于随机算法的研究扩展到弱平衡树，发现唯一性仍然失效。

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

查看原文本刊更多论文

Optimal randomized algorithms of weakly-balanced multi-branching AND-OR trees

This article treats AND-OR tree computation in terms of query complexity. We are interested in the cases where assignments (inputs) or algorithms are randomized. For the former case, it is known that there is a unique randomized assignment achieving the distributional complexity of balanced trees. On the other hand, the dual problem has the opposite result; the optimal randomized algorithms for balanced trees are not unique. We extend the latter study on randomized algorithms to weakly-balanced trees, and see that the uniqueness still fails.

求助全文

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

来源期刊

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.