Divisibility Theory and Complexity of Algorithms in Free Partially Commutative Groups

Details Divisibility Theory and Complexity of Algorithms in Free Partially Commutative Groups Divisibility Theory and Complexity of Algorithms in Free Partially Commutative Groups

2005-12-16

arxiv.org/abs/math/0512401v2

E.S. Esyp, I.V. Kazatchkov and V.N. Remeslennikov, {\em Divisibility Theory and Complexity of Algorithms for Free Partially

Mathematics

Group Theory

43 pages, Appendix included

Scientific paper

The 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.

Affiliated with

Also associated with

No associations

Rating

Divisibility Theory and Complexity of Algorithms in Free Partially Commutative Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Divisibility Theory and Complexity of Algorithms in Free Partially Commutative Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Divisibility Theory and Complexity of Algorithms in Free Partially Commutative Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-112401