Показать сокращенную информацию
dc.contributor.author | Wang S. | |
dc.contributor.author | Wu G. | |
dc.contributor.author | Yamaleev M. | |
dc.date.accessioned | 2020-01-15T21:18:06Z | |
dc.date.available | 2020-01-15T21:18:06Z | |
dc.date.issued | 2019 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/155605 | |
dc.description.abstract | © 2019, Springer Nature Switzerland AG. We prove in this paper that the d.r.e. wtt-degrees are dense, improving a result of Wu and Yamaleev. Our result is a direct generalization of Ladner and Sasso’s splitting theorem for r.e. wtt-degrees. One essential feature of our construction is that the Lachlan sets are used as a help to obtain more information of d.r.e. sets. | |
dc.relation.ispartofseries | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
dc.title | The d.r.e wtt-Degrees are Dense | |
dc.type | Conference Paper | |
dc.relation.ispartofseries-volume | 11558 LNCS | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 277 | |
dc.source.id | SCOPUS03029743-2019-11558-SID85069472592 |