Pub Date : 2021-03-10DOI: 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}
Pub Date : 2020-06-24DOI: 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}
Pub Date : 2020-06-24DOI: 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}
Pub Date : 2020-06-24DOI: 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}
Pub Date : 2020-06-24DOI: 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}
Pub Date : 2020-06-24DOI: 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}
Pub Date : 2020-06-24DOI: 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}
Pub Date : 2020-06-24DOI: 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}
Pub Date : 2020-06-24DOI: 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}
Pub Date : 2020-06-24DOI: 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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：