Divisibility Theory and Complexity of Algorithms in Free Partially Commutative Groups

Simple item page
dc.creatorEsyp, E. S.
dc.creatorKazachkov, I. V.
dc.creatorRemeslennikov, V. N.
dc.date2005-12-16
dc.date2005-12-17
dc.date.accessioned2026-07-07T06:55:25Z
dc.date.available2026-07-07T06:55:25Z
dc.descriptionThe original version of the paper was published in Contemporary Mathematics 378 ``Groups, Languages, Algorithms''; 2005, pp. 319-348. This is a modified version with Appendix that holds a corrected formulation of Proposition 4.1.
dc.description43 pages, Appendix included
dc.identifierhttps://arxiv.org/abs/math/0512401
dc.identifierhttp://arxiv.org/abs/math/0512401
dc.identifierE.S. Esyp, I.V. Kazatchkov and V.N. Remeslennikov, {\em Divisibility Theory and Complexity of Algorithms for Free Partially Commutative Groups}, Contemporary Mathematics 378 ``Groups, Languages, Algorithms''; 2005, pp. 319-348
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/106274
dc.subjectGroup Theory
dc.subject20E06; 20F05; 20F10
dc.titleDivisibility Theory and Complexity of Algorithms in Free Partially Commutative Groups
dc.typetext

Files

Collections

arXiv