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

Theory of Computing Systems最新文献

筛选
英文 中文
Submodular Functions and Rooted Trees 子模函数与有根树
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-07-29 DOI: 10.1007/s00224-022-10092-x
Yaokun Wu, Yinfeng Zhu
{"title":"Submodular Functions and Rooted Trees","authors":"Yaokun Wu, Yinfeng Zhu","doi":"10.1007/s00224-022-10092-x","DOIUrl":"https://doi.org/10.1007/s00224-022-10092-x","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":"66 1","pages":"1047 - 1073"},"PeriodicalIF":0.5,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42253597","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 Framework for Memory Efficient Context-Sensitive Program Analysis 一种内存高效的上下文敏感程序分析框架
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-07-18 DOI: 10.1007/s00224-022-10093-w
Mathias Hedenborg, Jonas Lundberg, Welf Löwe, M. Trapp
{"title":"A Framework for Memory Efficient Context-Sensitive Program Analysis","authors":"Mathias Hedenborg, Jonas Lundberg, Welf Löwe, M. Trapp","doi":"10.1007/s00224-022-10093-w","DOIUrl":"https://doi.org/10.1007/s00224-022-10093-w","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":"66 1","pages":"911 - 956"},"PeriodicalIF":0.5,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44185901","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}
引用次数: 2
The Complexity of the Distributed Constraint Satisfaction Problem 分布式约束满足问题的复杂性
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-07-08 DOI: 10.1007/s00224-022-10091-y
Silvia Butti, Víctor Dalmau
{"title":"The Complexity of the Distributed Constraint Satisfaction Problem","authors":"Silvia Butti, Víctor Dalmau","doi":"10.1007/s00224-022-10091-y","DOIUrl":"https://doi.org/10.1007/s00224-022-10091-y","url":null,"abstract":"<p>We study the complexity of the Distributed Constraint Satisfaction Problem (DCSP) on a synchronous, anonymous network from a theoretical standpoint. In this setting, variables and constraints are controlled by agents which communicate with each other by sending messages through fixed communication channels. Our results endorse the well-known fact from classical CSPs that the complexity of fixed-template computational problems depends on the template’s invariance under certain operations. Specifically, we show that DCSP(Γ) is polynomial-time tractable if and only if Γ is invariant under symmetric polymorphisms of all arities. Otherwise, there are no algorithms that solve DCSP(Γ) in finite time. We also show that the same condition holds for the search variant of DCSP. Collaterally, our results unveil a feature of the processes’ neighbourhood in a distributed network, its iterated degree, which plays a major role in the analysis. We explore this notion establishing a tight connection with the basic linear programming relaxation of a CSP.</p>","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":"393 ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138514123","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
Non-Existence of Stable Social Groups in Information-Driven Networks 信息驱动网络中不存在稳定的社会群体
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-07-06 DOI: 10.1007/s00224-022-10089-6
A. Chaintreau, G. Ducoffe, Dorian Mazauric
{"title":"Non-Existence of Stable Social Groups in Information-Driven Networks","authors":"A. Chaintreau, G. Ducoffe, Dorian Mazauric","doi":"10.1007/s00224-022-10089-6","DOIUrl":"https://doi.org/10.1007/s00224-022-10089-6","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":"66 1","pages":"758 - 777"},"PeriodicalIF":0.5,"publicationDate":"2022-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44169089","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
Holographic Algorithms on Domains of General Size 一般尺寸域上的全息算法
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-07-01 DOI: 10.1007/s00224-022-10088-7
Zhiguo Fu, Jin-Yi Cai
{"title":"Holographic Algorithms on Domains of General Size","authors":"Zhiguo Fu, Jin-Yi Cai","doi":"10.1007/s00224-022-10088-7","DOIUrl":"https://doi.org/10.1007/s00224-022-10088-7","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":"67 1","pages":"417 - 436"},"PeriodicalIF":0.5,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47724867","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
Subclasses of Ptime Interpreted by Programming Languages 编程语言解释的Ptime子类
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-06-29 DOI: 10.1007/s00224-022-10074-z
Siddharth Bhaskar, Cynthia Kop, J. Simonsen
{"title":"Subclasses of Ptime Interpreted by Programming Languages","authors":"Siddharth Bhaskar, Cynthia Kop, J. Simonsen","doi":"10.1007/s00224-022-10074-z","DOIUrl":"https://doi.org/10.1007/s00224-022-10074-z","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":"67 1","pages":"437 - 472"},"PeriodicalIF":0.5,"publicationDate":"2022-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48111184","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}
引用次数: 2
Arithmetic Circuits, Structured Matrices and (not so) Deep Learning 算术电路、结构化矩阵和深度学习
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-06-24 DOI: 10.1007/s00224-022-10112-w
A. Rudra
{"title":"Arithmetic Circuits, Structured Matrices and (not so) Deep Learning","authors":"A. Rudra","doi":"10.1007/s00224-022-10112-w","DOIUrl":"https://doi.org/10.1007/s00224-022-10112-w","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":"67 1","pages":"592-626"},"PeriodicalIF":0.5,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42259007","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
On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters 直径不大的度量空间中的随机完美匹配
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-06-17 DOI: 10.1007/s00224-022-10087-8
Ching-Lueh Chang
{"title":"On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters","authors":"Ching-Lueh Chang","doi":"10.1007/s00224-022-10087-8","DOIUrl":"https://doi.org/10.1007/s00224-022-10087-8","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":"66 1","pages":"847 - 860"},"PeriodicalIF":0.5,"publicationDate":"2022-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46068180","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 on algorithmic game theory (SAGT 2019) 算法博弈论特刊（SAGT 2019）
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-06-01 DOI: 10.1007/s00224-022-10086-9
Dimitris Fotakis, E. Markakis
{"title":"Special issue on algorithmic game theory (SAGT 2019)","authors":"Dimitris Fotakis, E. Markakis","doi":"10.1007/s00224-022-10086-9","DOIUrl":"https://doi.org/10.1007/s00224-022-10086-9","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":"66 1","pages":"517 - 518"},"PeriodicalIF":0.5,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43268116","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
Factorizing Strings into Repetitions 将字符串分解为重复
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-04-01 DOI: 10.1007/s00224-022-10070-3
Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, H. Bannai, M. Takeda
{"title":"Factorizing Strings into Repetitions","authors":"Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, H. Bannai, M. Takeda","doi":"10.1007/s00224-022-10070-3","DOIUrl":"https://doi.org/10.1007/s00224-022-10070-3","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":"66 1","pages":"484 - 501"},"PeriodicalIF":0.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48831005","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}
引用次数: 1
首页 上一页 下一页 尾页
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学术官方微信