2025-02-23T00:25:54-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs.admjournal.luguniv.edu.ua%3Aarticle-1034%22&qt=morelikethis&rows=5
2025-02-23T00:25:54-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs.admjournal.luguniv.edu.ua%3Aarticle-1034%22&qt=morelikethis&rows=5
2025-02-23T00:25:54-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T00:25:54-05:00 DEBUG: Deserialized SOLR response
The word problem in Hanoi Towers groups
We prove that the elements of the Hanoi Towers groups \(\mathcal{H}_m\) have depth bounded from above by a poly-logarithmic function \(O(\log^{m-2} n)\), where \(n\) is the length of an element. Therefore the word problem in groups \(\mathcal{H}_m\) is solvable in subexponential time \(exp(O(\log^{m...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2018
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1034 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|