Mathematical Aspects of the Heap Paradox and the Hidden Parameter

Authors: Maslov V.P.¹^,2
Affiliations:
1. National Research University Higher School of Economics
2. Ishlinsky Institute for Problems in Mechanics
Issue: Vol 103, No 3-4 (2018)
Pages: 678-680
Section: Short Communications
URL: https://journal-vniispk.ru/0001-4346/article/view/150844
DOI: https://doi.org/10.1134/S0001434618030379
ID: 150844

Cite item

Full Text

Open Access
Restricted Access

Access granted
Restricted Access

Subscription Access

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

Author for correspondence.
Email: v.p.maslov@mail.ru
Russian Federation, Moscow; Moscow

Supplementary Files

Action

1. JATS XML