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

Theory of Computing Systems最新文献

筛选
英文 中文
Polynomially Ambiguous Unary Weighted Automata over Fields 域上的多项式二义一元加权自动机
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-11-10 DOI: 10.1007/s00224-022-10107-7
Peter Kostolányi
{"title":"Polynomially Ambiguous Unary Weighted Automata over Fields","authors":"Peter Kostolányi","doi":"10.1007/s00224-022-10107-7","DOIUrl":"https://doi.org/10.1007/s00224-022-10107-7","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45892058","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
On the Rejection Rate of Exact Sampling Algorithm for Discrete Gaussian Distributions over the Integers 整数上离散高斯分布精确抽样算法的拒绝率
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-10-06 DOI: 10.1007/s00224-022-10102-y
Yusong Du, Xiao Ma
{"title":"On the Rejection Rate of Exact Sampling Algorithm for Discrete Gaussian Distributions over the Integers","authors":"Yusong Du, Xiao Ma","doi":"10.1007/s00224-022-10102-y","DOIUrl":"https://doi.org/10.1007/s00224-022-10102-y","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41469554","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 Grid Coloring 网格着色的复杂性
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-09-24 DOI: 10.1007/s00224-022-10098-5
Daniel Apon
{"title":"The Complexity of Grid Coloring","authors":"Daniel Apon","doi":"10.1007/s00224-022-10098-5","DOIUrl":"https://doi.org/10.1007/s00224-022-10098-5","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45103033","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
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs 边缘彩色图中计算彩色切割的精细参数化
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-09-22 DOI: 10.1007/s00224-022-10101-z
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
{"title":"Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs","authors":"Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer","doi":"10.1007/s00224-022-10101-z","DOIUrl":"https://doi.org/10.1007/s00224-022-10101-z","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45610239","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}
引用次数: 3
Ergodic Theorems and Converses for PSPACE Functions PSPACE函数的遍历定理与逆
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-08-30 DOI: 10.1007/s00224-022-10094-9
S. Nandakumar, Subin Pulari
{"title":"Ergodic Theorems and Converses for PSPACE Functions","authors":"S. Nandakumar, Subin Pulari","doi":"10.1007/s00224-022-10094-9","DOIUrl":"https://doi.org/10.1007/s00224-022-10094-9","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43923542","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
(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions 具有半严格拟凹代价函数的2人2值对策的（In）平衡的存在性
IF 0.5 4区 计算机科学
Theory of Computing Systems Pub Date : 2022-08-12 DOI: 10.1007/s00224-022-10095-8
Chryssis Georgiou, M. Mavronicolas, B. Monien
{"title":"(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions","authors":"Chryssis Georgiou, M. Mavronicolas, B. Monien","doi":"10.1007/s00224-022-10095-8","DOIUrl":"https://doi.org/10.1007/s00224-022-10095-8","url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47124002","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
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":null,"pages":null},"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":null,"pages":null},"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":null,"pages":null},"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":null,"pages":null},"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
首页 上一页 下一页 尾页
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学术官方微信