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

International Symposium on Fundamentals of Computation Theory最新文献

筛选
英文 中文
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes 遗传图类上查找具有遗传性质子图的参数化复杂度
International Symposium on Fundamentals of Computation Theory Pub Date : 2021-01-25 DOI: 10.1007/978-3-030-86593-1_15
D. Eppstein, Siddharth Gupta, Elham Havvaei
{"title":"Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes","authors":"D. Eppstein, Siddharth Gupta, Elham Havvaei","doi":"10.1007/978-3-030-86593-1_15","DOIUrl":"https://doi.org/10.1007/978-3-030-86593-1_15","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"29 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120911415","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
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization 从对称到不对称:用参数化推广TSP近似
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-11-06 DOI: 10.1007/978-3-030-86593-1_4
Lukas Behrendt, Katrin Casel, T. Friedrich, J. Lagodzinski, Alexander Löser, Marcus Wilhelm
{"title":"From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization","authors":"Lukas Behrendt, Katrin Casel, T. Friedrich, J. Lagodzinski, Alexander Löser, Marcus Wilhelm","doi":"10.1007/978-3-030-86593-1_4","DOIUrl":"https://doi.org/10.1007/978-3-030-86593-1_4","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121299781","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
Regular Model Checking with Regular Relations 使用规则关系进行规则模型检查
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-10-20 DOI: 10.1007/978-3-030-86593-1_13
V. Dave, Taylor Dohmen, S. Krishna, Ashutosh Trivedi
{"title":"Regular Model Checking with Regular Relations","authors":"V. Dave, Taylor Dohmen, S. Krishna, Ashutosh Trivedi","doi":"10.1007/978-3-030-86593-1_13","DOIUrl":"https://doi.org/10.1007/978-3-030-86593-1_13","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120969027","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
Some Observations on Dynamic Random Walks and Network Renormalization 动态随机漫步和网络重整化的一些观察
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-08-12 DOI: 10.1007/978-3-030-25027-0_2
B. Chazelle
{"title":"Some Observations on Dynamic Random Walks and Network Renormalization","authors":"B. Chazelle","doi":"10.1007/978-3-030-25027-0_2","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_2","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130925220","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
Two Characterizations of Finite-State Dimension 有限状态维的两种表征
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-08-12 DOI: 10.1007/978-3-030-25027-0_6
A. Kozachinskiy, A. Shen
{"title":"Two Characterizations of Finite-State Dimension","authors":"A. Kozachinskiy, A. Shen","doi":"10.1007/978-3-030-25027-0_6","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_6","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128213457","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}
引用次数: 4
Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting 带有原子替换的名义语法:匹配、统一、重写
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-08-12 DOI: 10.1007/978-3-030-25027-0_5
Jesús Domínguez, M. Fernández
{"title":"Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting","authors":"Jesús Domínguez, M. Fernández","doi":"10.1007/978-3-030-25027-0_5","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_5","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128726073","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
Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps 承诺约束满足问题的代数理论，第一步
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-08-12 DOI: 10.1007/978-3-030-25027-0_1
L. Barto
{"title":"Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps","authors":"L. Barto","doi":"10.1007/978-3-030-25027-0_1","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_1","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123335098","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
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity 一些边图问题的扩展:标准复杂度和参数化复杂度
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-08-12 DOI: 10.1007/978-3-030-25027-0_13
Katrin Casel, H. Fernau, M. K. Ghadikolaei, J. Monnot, F. Sikora
{"title":"Extension of Some Edge Graph Problems: Standard and Parameterized Complexity","authors":"Katrin Casel, H. Fernau, M. K. Ghadikolaei, J. Monnot, F. Sikora","doi":"10.1007/978-3-030-25027-0_13","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_13","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124274805","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}
引用次数: 10
Winning Strategies for Streaming Rewriting Games 流媒体重写游戏的制胜策略
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-08-12 DOI: 10.1007/978-3-030-25027-0_4
Christian Coester, T. Schwentick, M. Schuster
{"title":"Winning Strategies for Streaming Rewriting Games","authors":"Christian Coester, T. Schwentick, M. Schuster","doi":"10.1007/978-3-030-25027-0_4","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_4","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124950053","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
Optimal Channel Utilization with Limited Feedback 有限反馈下的最优信道利用率
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-08-12 DOI: 10.1007/978-3-030-25027-0_10
G. D. Marco, T. Jurdzinski, D. Kowalski
{"title":"Optimal Channel Utilization with Limited Feedback","authors":"G. D. Marco, T. Jurdzinski, D. Kowalski","doi":"10.1007/978-3-030-25027-0_10","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_10","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123841716","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}
引用次数: 8
首页 上一页 下一页 尾页
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学术官方微信