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

Beyond the Horizon of Computability最新文献

筛选
英文 中文
Correction to: #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method 修正:计数更新有向图、Cacti和串并联分解方法的# p -完备性
Beyond the Horizon of Computability Pub Date : 2021-03-10 DOI: 10.1007/978-3-030-51466-2_34
Kévin Perrot, Sylvain Sené, Lucas Venturini
{"title":"Correction to: #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method","authors":"Kévin Perrot, Sylvain Sené, Lucas Venturini","doi":"10.1007/978-3-030-51466-2_34","DOIUrl":"https://doi.org/10.1007/978-3-030-51466-2_34","url":null,"abstract":"","PeriodicalId":418583,"journal":{"name":"Beyond the Horizon of Computability","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122321656","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
Repetitions in Toeplitz Words and the Thue Threshold Toeplitz词的重复和Thue阈值
Beyond the Horizon of Computability Pub Date : 2020-06-24 DOI: 10.1007/978-3-030-51466-2_23
A. Boccuto, A. Carpi
{"title":"Repetitions in Toeplitz Words and the Thue Threshold","authors":"A. Boccuto, A. Carpi","doi":"10.1007/978-3-030-51466-2_23","DOIUrl":"https://doi.org/10.1007/978-3-030-51466-2_23","url":null,"abstract":"","PeriodicalId":418583,"journal":{"name":"Beyond the Horizon of Computability","volume":"220 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115527813","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
On the Complexity of Conversion Between Classic Real Number Representations 经典实数表示之间转换的复杂性
Beyond the Horizon of Computability Pub Date : 2020-06-24 DOI: 10.1007/978-3-030-51466-2_7
L. Kristiansen, J. Simonsen
{"title":"On the Complexity of Conversion Between Classic Real Number Representations","authors":"L. Kristiansen, J. Simonsen","doi":"10.1007/978-3-030-51466-2_7","DOIUrl":"https://doi.org/10.1007/978-3-030-51466-2_7","url":null,"abstract":"","PeriodicalId":418583,"journal":{"name":"Beyond the Horizon of Computability","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128682161","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 Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings 递归函数的归纳推理、复杂性理论与递归数论的相互作用
Beyond the Horizon of Computability Pub Date : 2020-06-24 DOI: 10.1007/978-3-030-51466-2_11
T. Zeugmann
{"title":"On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings","authors":"T. Zeugmann","doi":"10.1007/978-3-030-51466-2_11","DOIUrl":"https://doi.org/10.1007/978-3-030-51466-2_11","url":null,"abstract":"","PeriodicalId":418583,"journal":{"name":"Beyond the Horizon of Computability","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133207481","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
Prawf: An Interactive Proof System for Program Extraction Prawf:程序抽取的交互式证明系统
Beyond the Horizon of Computability Pub Date : 2020-06-24 DOI: 10.1007/978-3-030-51466-2_12
Ulrich Berger, Olga Petrovska, H. Tsuiki
{"title":"Prawf: An Interactive Proof System for Program Extraction","authors":"Ulrich Berger, Olga Petrovska, H. Tsuiki","doi":"10.1007/978-3-030-51466-2_12","DOIUrl":"https://doi.org/10.1007/978-3-030-51466-2_12","url":null,"abstract":"","PeriodicalId":418583,"journal":{"name":"Beyond the Horizon of Computability","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114580060","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
Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind Arrays 由Saind数组生成的3-一致超图的度序列的组合性质
Beyond the Horizon of Computability Pub Date : 2020-06-24 DOI: 10.1007/978-3-030-51466-2_20
A. Frosini, Giulia Palma, S. Rinaldi
{"title":"Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind Arrays","authors":"A. Frosini, Giulia Palma, S. Rinaldi","doi":"10.1007/978-3-030-51466-2_20","DOIUrl":"https://doi.org/10.1007/978-3-030-51466-2_20","url":null,"abstract":"","PeriodicalId":418583,"journal":{"name":"Beyond the Horizon of Computability","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130083057","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
Recent Advances in Text-to-Pattern Distance Algorithms 文本到模式距离算法的最新进展
Beyond the Horizon of Computability Pub Date : 2020-06-24 DOI: 10.1007/978-3-030-51466-2_32
P. Uznański
{"title":"Recent Advances in Text-to-Pattern Distance Algorithms","authors":"P. Uznański","doi":"10.1007/978-3-030-51466-2_32","DOIUrl":"https://doi.org/10.1007/978-3-030-51466-2_32","url":null,"abstract":"","PeriodicalId":418583,"journal":{"name":"Beyond the Horizon of Computability","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123422783","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
Balancing Straight-Line Programs for Strings and Trees 平衡直线规划的字符串和树
Beyond the Horizon of Computability Pub Date : 2020-06-24 DOI: 10.1007/978-3-030-51466-2_26
Markus Lohrey
{"title":"Balancing Straight-Line Programs for Strings and Trees","authors":"Markus Lohrey","doi":"10.1007/978-3-030-51466-2_26","DOIUrl":"https://doi.org/10.1007/978-3-030-51466-2_26","url":null,"abstract":"","PeriodicalId":418583,"journal":{"name":"Beyond the Horizon of Computability","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128512732","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
Faster Online Computation of the Succinct Longest Previous Factor Array 简练最长先前因子数组的更快在线计算
Beyond the Horizon of Computability Pub Date : 2020-06-24 DOI: 10.1007/978-3-030-51466-2_31
N. Prezza, Giovanna Rosone
{"title":"Faster Online Computation of the Succinct Longest Previous Factor Array","authors":"N. Prezza, Giovanna Rosone","doi":"10.1007/978-3-030-51466-2_31","DOIUrl":"https://doi.org/10.1007/978-3-030-51466-2_31","url":null,"abstract":"","PeriodicalId":418583,"journal":{"name":"Beyond the Horizon of Computability","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126377384","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
Time-Aware Uniformization of Winning Strategies 获胜策略的时间感知统一化
Beyond the Horizon of Computability Pub Date : 2020-06-24 DOI: 10.1007/978-3-030-51466-2_17
Stéphane Le Roux
{"title":"Time-Aware Uniformization of Winning Strategies","authors":"Stéphane Le Roux","doi":"10.1007/978-3-030-51466-2_17","DOIUrl":"https://doi.org/10.1007/978-3-030-51466-2_17","url":null,"abstract":"","PeriodicalId":418583,"journal":{"name":"Beyond the Horizon of Computability","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126969547","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
下一页 尾页
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学术官方微信