Efficient Algorithm for Recognizing the Nielsen-Thurston Type of a Three-Strand Braid
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605525137 | ||
| 003 | CHVBK | ||
| 005 | 20210128100757.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150601xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s10958-015-2422-5 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s10958-015-2422-5 | ||
| 100 | 1 | |a Biryukov |D O. |u Moscow State Region Institute of Social Studies and Humanities, 30, Zelenaya St, 140410, Kolomna, Russia |4 aut | |
| 245 | 1 | 0 | |a Efficient Algorithm for Recognizing the Nielsen-Thurston Type of a Three-Strand Braid |h [Elektronische Daten] |c [O. Biryukov] |
| 520 | 3 | |a We propose an efficient algorithm for recognizing the Nielsen-Thurston type of a braid in the braid group B3. The algorithm has linear complexity on the input word length. Bibliography: 11 titles. Illustrations: 5 figures. | |
| 540 | |a Springer Science+Business Media New York, 2015 | ||
| 773 | 0 | |t Journal of Mathematical Sciences |d Springer US; http://www.springer-ny.com |g 208/1(2015-06-01), 49-58 |x 1072-3374 |q 208:1<49 |1 2015 |2 208 |o 10958 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s10958-015-2422-5 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s10958-015-2422-5 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 100 |E 1- |a Biryukov |D O. |u Moscow State Region Institute of Social Studies and Humanities, 30, Zelenaya St, 140410, Kolomna, Russia |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Journal of Mathematical Sciences |d Springer US; http://www.springer-ny.com |g 208/1(2015-06-01), 49-58 |x 1072-3374 |q 208:1<49 |1 2015 |2 208 |o 10958 | ||