Path Reconstruction in the Barning–Hall Tree

P. G. Emelyanov

doi:10.1007/s10958-014-2034-5

Path Reconstruction in the Barning–Hall Tree

Результат исследования: Научные публикации в периодических изданиях › статья › рецензирование

Аннотация

We propose an algorithm for reconstructing a tree path from a root to a primitive Pythagorean triple. The algorithm has polynomial time complexity with respect to the input length relating to the “size” of the primitive Pythagorean triple.

Язык оригинала	английский
Страницы (с-по)	72-79
Число страниц	8
Журнал	Journal of Mathematical Sciences (United States)
Том	202
Номер выпуска	1
DOI	https://doi.org/10.1007/s10958-014-2034-5
Состояние	Опубликовано - окт 2014

Доступ к документу

10.1007/s10958-014-2034-5

Link to publication in Scopus

Fingerprint Подробные сведения о темах исследования «Path Reconstruction in the Barning–Hall Tree». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать

@article{7ab4ca02c40242c1a07a7c65347f2ab4,

title = "Path Reconstruction in the Barning–Hall Tree",

abstract = "We propose an algorithm for reconstructing a tree path from a root to a primitive Pythagorean triple. The algorithm has polynomial time complexity with respect to the input length relating to the “size” of the primitive Pythagorean triple.",

author = "Emelyanov, {P. G.}",

year = "2014",

month = oct,

doi = "10.1007/s10958-014-2034-5",

language = "English",

volume = "202",

pages = "72--79",

journal = "Journal of Mathematical Sciences (United States)",

issn = "1072-3374",

publisher = "Springer Nature",

number = "1",

}

TY - JOUR

T1 - Path Reconstruction in the Barning–Hall Tree

AU - Emelyanov, P. G.

PY - 2014/10

Y1 - 2014/10

N2 - We propose an algorithm for reconstructing a tree path from a root to a primitive Pythagorean triple. The algorithm has polynomial time complexity with respect to the input length relating to the “size” of the primitive Pythagorean triple.

AB - We propose an algorithm for reconstructing a tree path from a root to a primitive Pythagorean triple. The algorithm has polynomial time complexity with respect to the input length relating to the “size” of the primitive Pythagorean triple.

UR - http://www.scopus.com/inward/record.url?scp=85028152396&partnerID=8YFLogxK

U2 - 10.1007/s10958-014-2034-5

DO - 10.1007/s10958-014-2034-5

M3 - Article

AN - SCOPUS:85028152396

VL - 202

SP - 72

EP - 79

JO - Journal of Mathematical Sciences (United States)

JF - Journal of Mathematical Sciences (United States)

SN - 1072-3374

IS - 1

ER -