Mathematical Aspects of the Heap Paradox and the Hidden Parameter

作者: Maslov V.P.¹^,2
隶属关系:
1. National Research University Higher School of Economics
2. Ishlinsky Institute for Problems in Mechanics
期: 卷 103, 编号 3-4 (2018)
页面: 678-680
栏目: Short Communications
URL: https://journals.rcsi.science/0001-4346/article/view/150844
DOI: https://doi.org/10.1134/S0001434618030379
ID: 150844

如何引用文章

全文:

开放存取

##reader.subscriptionAccessGranted##
受限制的访问

订阅存取

heap paradox, time complexity, numeration theory, hidden parameter, traveling salesman problem, combinatorial optimization, minimum spanning tree

National Research University Higher School of Economics; Ishlinsky Institute for Problems in Mechanics

编辑信件的主要联系方式.
Email: v.p.maslov@mail.ru
俄罗斯联邦, Moscow; Moscow

附件文件

动作

1. JATS XML