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

International Symposium on Fundamentals of Computation Theory最新文献

筛选
英文 中文
The Fault-Tolerant Metric Dimension of Cographs 图的容错度量维
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-04-07 DOI: 10.1007/978-3-030-25027-0_24
Duygu Vietz, Egon Wanke
{"title":"The Fault-Tolerant Metric Dimension of Cographs","authors":"Duygu Vietz, Egon Wanke","doi":"10.1007/978-3-030-25027-0_24","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_24","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115907214","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
Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle 关于Oracle的完全不相交conp -对但不完全全多项式搜索问题
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-03-28 DOI: 10.1007/978-3-030-25027-0_11
Titus Dose
{"title":"Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle","authors":"Titus Dose","doi":"10.1007/978-3-030-25027-0_11","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_11","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129441902","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
Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel 共享通道上任意长度作业的容错并行调度
International Symposium on Fundamentals of Computation Theory Pub Date : 2017-10-20 DOI: 10.1007/978-3-030-25027-0_21
M. Klonowski, D. Kowalski, Jaroslaw Mirek, Prudence W. H. Wong
{"title":"Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel","authors":"M. Klonowski, D. Kowalski, Jaroslaw Mirek, Prudence W. H. Wong","doi":"10.1007/978-3-030-25027-0_21","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_21","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125472630","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
What One Has to Know When Attacking P vs. NP (Extended Abstract) 攻击P与NP时必须知道的东西(扩展抽象)
International Symposium on Fundamentals of Computation Theory Pub Date : 2017-09-11 DOI: 10.1007/978-3-662-55751-8_2
J. Hromkovic, P. Rossmanith
{"title":"What One Has to Know When Attacking P vs. NP (Extended Abstract)","authors":"J. Hromkovic, P. Rossmanith","doi":"10.1007/978-3-662-55751-8_2","DOIUrl":"https://doi.org/10.1007/978-3-662-55751-8_2","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123897180","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
Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars 多上下文无关的树语法和多组件树相邻语法
International Symposium on Fundamentals of Computation Theory Pub Date : 2017-09-11 DOI: 10.1007/978-3-662-55751-8_18
J. Engelfriet, A. Maletti
{"title":"Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars","authors":"J. Engelfriet, A. Maletti","doi":"10.1007/978-3-662-55751-8_18","DOIUrl":"https://doi.org/10.1007/978-3-662-55751-8_18","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133225870","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
A Tour of Recent Results on Word Transducers 词换能器的最新研究成果综述
International Symposium on Fundamentals of Computation Theory Pub Date : 2017-09-11 DOI: 10.1007/978-3-662-55751-8_3
A. Muscholl
{"title":"A Tour of Recent Results on Word Transducers","authors":"A. Muscholl","doi":"10.1007/978-3-662-55751-8_3","DOIUrl":"https://doi.org/10.1007/978-3-662-55751-8_3","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131066324","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
Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time 在最优时间内列出稀疏图中所有定长简单循环
International Symposium on Fundamentals of Computation Theory Pub Date : 2017-09-11 DOI: 10.1007/978-3-662-55751-8_28
G. Manoussakis
{"title":"Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time","authors":"G. Manoussakis","doi":"10.1007/978-3-662-55751-8_28","DOIUrl":"https://doi.org/10.1007/978-3-662-55751-8_28","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116104355","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
Testing Polynomial Equivalence by Scaling Matrices 用矩阵标度法检验多项式等价性
International Symposium on Fundamentals of Computation Theory Pub Date : 2017-09-11 DOI: 10.1007/978-3-662-55751-8_10
M. Bläser, B. V. R. Rao, Jayalal Sarma
{"title":"Testing Polynomial Equivalence by Scaling Matrices","authors":"M. Bläser, B. V. R. Rao, Jayalal Sarma","doi":"10.1007/978-3-662-55751-8_10","DOIUrl":"https://doi.org/10.1007/978-3-662-55751-8_10","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130338760","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
Automata and Program Analysis 自动机与程序分析
International Symposium on Fundamentals of Computation Theory Pub Date : 2017-09-11 DOI: 10.1007/978-3-662-55751-8_1
Thomas Colcombet, Laure Daviaud, Florian Zuleger
{"title":"Automata and Program Analysis","authors":"Thomas Colcombet, Laure Daviaud, Florian Zuleger","doi":"10.1007/978-3-662-55751-8_1","DOIUrl":"https://doi.org/10.1007/978-3-662-55751-8_1","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127979294","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
Some Results of Zoltán Ésik on Regular Languages Zoltán Ésik关于常规语言的一些结果
International Symposium on Fundamentals of Computation Theory Pub Date : 2017-09-11 DOI: 10.1007/978-3-662-55751-8_4
J. Pin
{"title":"Some Results of Zoltán Ésik on Regular Languages","authors":"J. Pin","doi":"10.1007/978-3-662-55751-8_4","DOIUrl":"https://doi.org/10.1007/978-3-662-55751-8_4","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"42 3-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132060665","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学术官方微信