Pub Date : 2019-07-15DOI: 10.1007/978-3-030-22996-2_21
I. Petrakis
{"title":"Borel and Baire Sets in Bishop Spaces","authors":"I. Petrakis","doi":"10.1007/978-3-030-22996-2_21","DOIUrl":"https://doi.org/10.1007/978-3-030-22996-2_21","url":null,"abstract":"","PeriodicalId":436783,"journal":{"name":"Conference on Computability in Europe","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121996599","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 : 2019-07-15DOI: 10.1007/978-3-030-22996-2_20
Ruslan Ishkuvatov, D. Musatov
{"title":"On Approximate Uncomputability of the Kolmogorov Complexity Function","authors":"Ruslan Ishkuvatov, D. Musatov","doi":"10.1007/978-3-030-22996-2_20","DOIUrl":"https://doi.org/10.1007/978-3-030-22996-2_20","url":null,"abstract":"","PeriodicalId":436783,"journal":{"name":"Conference on Computability in Europe","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128277810","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 : 2019-07-15DOI: 10.1007/978-3-030-22996-2_2
L. Galeotti
{"title":"Surreal Blum-Shub-Smale Machines","authors":"L. Galeotti","doi":"10.1007/978-3-030-22996-2_2","DOIUrl":"https://doi.org/10.1007/978-3-030-22996-2_2","url":null,"abstract":"","PeriodicalId":436783,"journal":{"name":"Conference on Computability in Europe","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130496212","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 : 2019-06-19DOI: 10.1007/978-3-030-22996-2_9
N. Bazhenov, M. Mustafa, S. Ospichev
{"title":"Bounded Reducibility for Computable Numberings","authors":"N. Bazhenov, M. Mustafa, S. Ospichev","doi":"10.1007/978-3-030-22996-2_9","DOIUrl":"https://doi.org/10.1007/978-3-030-22996-2_9","url":null,"abstract":"","PeriodicalId":436783,"journal":{"name":"Conference on Computability in Europe","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122324809","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 : 2019-06-19DOI: 10.1007/978-3-030-22996-2_7
P. Welch
{"title":"Higher Type Recursion for Transfinite Machine Theory","authors":"P. Welch","doi":"10.1007/978-3-030-22996-2_7","DOIUrl":"https://doi.org/10.1007/978-3-030-22996-2_7","url":null,"abstract":"","PeriodicalId":436783,"journal":{"name":"Conference on Computability in Europe","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121482503","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 : 2019-03-23DOI: 10.1007/978-3-030-22996-2_18
I. Kalimullin, Russell G. Miller, H. Schoutens
{"title":"Degree Spectra for Transcendence in Fields","authors":"I. Kalimullin, Russell G. Miller, H. Schoutens","doi":"10.1007/978-3-030-22996-2_18","DOIUrl":"https://doi.org/10.1007/978-3-030-22996-2_18","url":null,"abstract":"","PeriodicalId":436783,"journal":{"name":"Conference on Computability in Europe","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126517302","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 : 2019-01-15DOI: 10.1007/978-3-030-22996-2_15
R. Dimitrov, V. Harizanov, A. Morozov, P. Shafer, Alexandra A. Soskova, S. Vatev
{"title":"Cohesive Powers of Linear Orders","authors":"R. Dimitrov, V. Harizanov, A. Morozov, P. Shafer, Alexandra A. Soskova, S. Vatev","doi":"10.1007/978-3-030-22996-2_15","DOIUrl":"https://doi.org/10.1007/978-3-030-22996-2_15","url":null,"abstract":"","PeriodicalId":436783,"journal":{"name":"Conference on Computability in Europe","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130146483","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}
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
We introduce and study the Bicolored $P_3$ Deletion problem defined as follows. The input is a graph $G=(V,E)$ where the edge set $E$ is partitioned into a set $E_r$ of red edges and a set $E_b$ of blue edges. The question is whether we can delete at most $k$ edges such that $G$ does not contain a bicolored $P_3$ as an induced subgraph. Here, a bicolored $P_3$ is a path on three vertices with one blue and one red edge. We show that Bicolored $P_3$ Deletion is NP-hard and cannot be solved in $2^{o(|V|+|E|)}$ time on bounded-degree graphs if the ETH is true. Then, we show that Bicolored $P_3$ Deletion is polynomial-time solvable when $G$ does not contain a bicolored $K_3$, that is, a triangle with edges of both colors. Moreover, we provide a polynomial-time algorithm for the case that $G$ contains no blue $P_3$, red $P_3$, blue $K_3$, and red $K_3$. Finally, we show that Bicolored $P_3$ Deletion can be solved in $ O(1.84^kcdot |V| cdot |E|)$ time and that it admits a kernel with $ O(kDeltamin(k,Delta))$ vertices, where $Delta$ is the maximum degree of $G$. Comment: 25 pages
{"title":"Destroying Bicolored P3s by Deleting Few Edges","authors":"Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer","doi":"10.46298/dmtcs.6108","DOIUrl":"https://doi.org/10.46298/dmtcs.6108","url":null,"abstract":"We introduce and study the Bicolored $P_3$ Deletion problem defined as\u0000follows. The input is a graph $G=(V,E)$ where the edge set $E$ is partitioned\u0000into a set $E_r$ of red edges and a set $E_b$ of blue edges. The question is\u0000whether we can delete at most $k$ edges such that $G$ does not contain a\u0000bicolored $P_3$ as an induced subgraph. Here, a bicolored $P_3$ is a path on\u0000three vertices with one blue and one red edge. We show that Bicolored $P_3$\u0000Deletion is NP-hard and cannot be solved in $2^{o(|V|+|E|)}$ time on\u0000bounded-degree graphs if the ETH is true. Then, we show that Bicolored $P_3$\u0000Deletion is polynomial-time solvable when $G$ does not contain a bicolored\u0000$K_3$, that is, a triangle with edges of both colors. Moreover, we provide a\u0000polynomial-time algorithm for the case that $G$ contains no blue $P_3$, red\u0000$P_3$, blue $K_3$, and red $K_3$. Finally, we show that Bicolored $P_3$\u0000Deletion can be solved in $ O(1.84^kcdot |V| cdot |E|)$ time and that it\u0000admits a kernel with $ O(kDeltamin(k,Delta))$ vertices, where $Delta$ is\u0000the maximum degree of $G$.\u0000\u0000 Comment: 25 pages","PeriodicalId":436783,"journal":{"name":"Conference on Computability in Europe","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121157936","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 : 2019-01-07DOI: 10.1007/978-3-030-22996-2_8
N. Bazhenov, H. Ganchev, S. Vatev
{"title":"Effective Embeddings for Pairs of Structures","authors":"N. Bazhenov, H. Ganchev, S. Vatev","doi":"10.1007/978-3-030-22996-2_8","DOIUrl":"https://doi.org/10.1007/978-3-030-22996-2_8","url":null,"abstract":"","PeriodicalId":436783,"journal":{"name":"Conference on Computability in Europe","volume":"290 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120976688","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 : 2018-07-30DOI: 10.1007/978-3-319-94418-0_2
P. Alaev, V. Selivanov
{"title":"Polynomial-Time Presentations of Algebraic Number Fields","authors":"P. Alaev, V. Selivanov","doi":"10.1007/978-3-319-94418-0_2","DOIUrl":"https://doi.org/10.1007/978-3-319-94418-0_2","url":null,"abstract":"","PeriodicalId":436783,"journal":{"name":"Conference on Computability in Europe","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124624074","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
扫码关注我们
求助内容：
应助结果提醒方式：