Access the full text.
Sign up today, get DeepDyve free for 14 days.
Abstract A recent collection of papers in the last years have given a renovated interest to the notion of orbit decidability . This is a new quite general algorithmic notion, connecting with several classical results, and closely related to the study of the conjugacy problem for extensions of groups. In the present survey we explain several of the classical results closely related to this concept, and we explain the main ideas behind the recent connection with the conjugacy problem made by Bogopolski–Martino–Ventura in (Trans. Amer. Math. Soc. 362 (2010), 2003–2036). All the consequences up to date, published in several other papers by other authors, are also commented and reviewed.
Groups Complexity Cryptology – de Gruyter
Published: Nov 1, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.