Аннотация
In connection with the relationship of the heap paradox with quantum mechanics pointed out by V. P. Maslov, the feasibility and complexity of algorithms for counting very large sets in small time intervals is studied.
Язык оригинала | английский |
---|---|
Страницы (с-по) | 180-184 |
Число страниц | 5 |
Журнал | Russian Journal of Mathematical Physics |
Том | 26 |
Номер выпуска | 2 |
DOI | |
Состояние | Опубликовано - 1 апр. 2019 |