首页 > 最新文献

Theory of Computing Systems最新文献

英文 中文
Polynomially Ambiguous Unary Weighted Automata over Fields 域上的多项式二义一元加权自动机
IF 0.5 4区 计算机科学 Q3 Computer Science
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区 计算机科学 Q3 Computer Science
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区 计算机科学 Q3 Computer Science
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区 计算机科学 Q3 Computer Science
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区 计算机科学 Q3 Computer Science
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区 计算机科学 Q3 Computer Science
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区 计算机科学 Q3 Computer Science
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区 计算机科学 Q3 Computer Science
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区 计算机科学 Q3 Computer Science
Theory of Computing Systems
Pub Date : 2022-07-08 DOI: 10.1007/s00224-022-10091-y
Silvia Butti, Víctor Dalmau

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.

本文从理论的角度研究了同步匿名网络上分布式约束满足问题的复杂性。在这种设置中，变量和约束由代理控制，这些代理通过固定的通信通道发送消息来相互通信。我们的结果支持经典csp中众所周知的事实，即固定模板计算问题的复杂性取决于模板在某些操作下的不变性。具体地说，我们证明了DCSP(Γ)是多项式时间可处理的当且仅当Γ在所有实态的对称多态下是不变的。否则，没有在有限时间内求解DCSP(Γ)的算法。我们还证明了同样的条件也适用于DCSP的搜索变体。此外，我们的结果揭示了分布式网络中过程邻居的特征，即其迭代程度，这在分析中起着重要作用。我们探索了这一概念，建立了与CSP的基本线性规划松弛的紧密联系。
{"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区 计算机科学 Q3 Computer Science
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
首页 上一页 下一页 尾页
类型
全部 化学•材料 生命科学 医学 物理 工程技术 环境•农林 材料科学 地球科学 法学 管理学 化学 环境科学与生态学 计算机科学 教育学 经济学 农林科学 人文科学 生物学 数学 物理与天体物理 心理学 综合性期刊 其他 工业工程 理学 历史学 农学 文学 信息工程
数据库
全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley
期刊
Theory of Computing Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们：info@booksci.cn
Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1