dc.contributor.author |
Frolov A. |
|
dc.date.accessioned |
2018-09-18T20:31:39Z |
|
dc.date.available |
2018-09-18T20:31:39Z |
|
dc.date.issued |
2010 |
|
dc.identifier.issn |
0037-4466 |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/140799 |
|
dc.description.abstract |
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discrete ordering of low degree has a computable representation, and study estimates for the complexity of all isomorphisms constructed in the article. © 2010 Pleiades Publishing, Ltd. |
|
dc.relation.ispartofseries |
Siberian Mathematical Journal |
|
dc.subject |
complexity |
|
dc.subject |
computable representation |
|
dc.subject |
linear ordering |
|
dc.subject |
low degree |
|
dc.subject |
order type |
|
dc.title |
Linear Orderings of Low Degree |
|
dc.type |
Article |
|
dc.relation.ispartofseries-issue |
5 |
|
dc.relation.ispartofseries-volume |
51 |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.relation.startpage |
913 |
|
dc.source.id |
SCOPUS00374466-2010-51-5-SID77958545045 |
|