Standard

Path Reconstruction in the Barning–Hall Tree. / Emelyanov, P. G.

в: Journal of Mathematical Sciences (United States), Том 202, № 1, 10.2014, стр. 72-79.

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

Harvard

Emelyanov, PG 2014, 'Path Reconstruction in the Barning–Hall Tree', Journal of Mathematical Sciences (United States), Том. 202, № 1, стр. 72-79. https://doi.org/10.1007/s10958-014-2034-5

APA

Emelyanov, P. G. (2014). Path Reconstruction in the Barning–Hall Tree. Journal of Mathematical Sciences (United States), 202(1), 72-79. https://doi.org/10.1007/s10958-014-2034-5

Vancouver

Emelyanov PG. Path Reconstruction in the Barning–Hall Tree. Journal of Mathematical Sciences (United States). 2014 окт.;202(1):72-79. doi: 10.1007/s10958-014-2034-5

Author

Emelyanov, P. G. / Path Reconstruction in the Barning–Hall Tree. в: Journal of Mathematical Sciences (United States). 2014 ; Том 202, № 1. стр. 72-79.

BibTeX

@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",

}

RIS

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 -

ID: 14280307