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

International Symposium on Fundamentals of Computation Theory最新文献

筛选
英文 中文
Conjunctive Visibly-Pushdown Path Queries 连接可见下推路径查询
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-08-17 DOI: 10.1007/978-3-319-22177-9_25
M. Lange, É. Lozes
{"title":"Conjunctive Visibly-Pushdown Path Queries","authors":"M. Lange, É. Lozes","doi":"10.1007/978-3-319-22177-9_25","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_25","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129726769","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Pairs Covered by a Sequence of Sets 由集合序列覆盖的对
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-08-17 DOI: 10.1007/978-3-319-22177-9_17
P. Damaschke
{"title":"Pairs Covered by a Sequence of Sets","authors":"P. Damaschke","doi":"10.1007/978-3-319-22177-9_17","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_17","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116744393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
On the Power of Color Refinement 论色彩提炼的力量
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-08-17 DOI: 10.1007/978-3-319-22177-9_26
V. Arvind, J. Köbler, Gaurav Rattan, O. Verbitsky
{"title":"On the Power of Color Refinement","authors":"V. Arvind, J. Köbler, Gaurav Rattan, O. Verbitsky","doi":"10.1007/978-3-319-22177-9_26","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_26","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133601019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
Nearest Fixed Points and Concurrent Priority Games 最近固定点和并发优先博弈
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-08-17 DOI: 10.1007/978-3-319-22177-9_29
Bruno Karelovic, Wieslaw Zielonka
{"title":"Nearest Fixed Points and Concurrent Priority Games","authors":"Bruno Karelovic, Wieslaw Zielonka","doi":"10.1007/978-3-319-22177-9_29","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_29","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123589896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
On Equivalences, Metrics, and Polynomial Time 关于等价、度量和多项式时间
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-08-17 DOI: 10.1007/978-3-319-22177-9_24
Alberto Cappai, Ugo Dal Lago
{"title":"On Equivalences, Metrics, and Polynomial Time","authors":"Alberto Cappai, Ugo Dal Lago","doi":"10.1007/978-3-319-22177-9_24","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_24","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"64 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124096577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Alternation Hierarchies of First Order Logic with Regular Predicates 正则谓词一阶逻辑的交替层次
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-08-17 DOI: 10.1007/978-3-319-22177-9_13
L. Dartois, Charles Paperman
{"title":"Alternation Hierarchies of First Order Logic with Regular Predicates","authors":"L. Dartois, Charles Paperman","doi":"10.1007/978-3-319-22177-9_13","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_13","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133490337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
On the Enumeration of Permutominoes 关于置换数的枚举
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-08-17 DOI: 10.1007/978-3-319-22177-9_4
Ana Paula Tomás
{"title":"On the Enumeration of Permutominoes","authors":"Ana Paula Tomás","doi":"10.1007/978-3-319-22177-9_4","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_4","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115780220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS 论概率VASS中长期平均性质的存在性和可计算性
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-08-17 DOI: 10.1007/978-3-319-22177-9_2
A. Kucera
{"title":"On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS","authors":"A. Kucera","doi":"10.1007/978-3-319-22177-9_2","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_2","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126223817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
ϵ-Almost Selectors and Their Applications ϵ-Almost选择器及其应用
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-08-17 DOI: 10.1007/978-3-319-22177-9_20
Annalisa De Bonis, U. Vaccaro
{"title":"ϵ-Almost Selectors and Their Applications","authors":"Annalisa De Bonis, U. Vaccaro","doi":"10.1007/978-3-319-22177-9_20","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_20","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121784441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations 多维二元向量分配问题:标准、结构及以上保证参数化
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-06-10 DOI: 10.23638/DMTCS-19-4-3
Marin Bougeret, Guillerme Duvillié, R. Giroudeau, Rémi Watrigant
{"title":"Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations","authors":"Marin Bougeret, Guillerme Duvillié, R. Giroudeau, Rémi Watrigant","doi":"10.23638/DMTCS-19-4-3","DOIUrl":"https://doi.org/10.23638/DMTCS-19-4-3","url":null,"abstract":"In this article we focus on the parameterized complexity of the Multidimensional Binary Vector Assignment problem (called bMVA). An input of this problem is defined by m disjoint sets (V^1, V^2, dots , V^m), each composed of n binary vectors of size p. An output is a set of n disjoint m-tuples of vectors, where each m-tuple is obtained by picking one vector from each set (V^i). To each m-tuple we associate a p dimensional vector by applying the bit-wise AND operation on the m vectors of the tuple. The objective is to minimize the total number of zeros in these n vectors. bMVA can be seen as a variant of multidimensional matching where hyperedges are implicitly locally encoded via labels attached to vertices, but was originally introduced in the context of integrated circuit manufacturing.","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116753442","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"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学术官方微信