Author： Chajda Ivan Kolařík Miroslav Länger Helmut
Publisher： Springer Publishing Company
ISSN： 1432-7643
Source： Soft Computing, Vol.15, Iss.1, 2011-01, pp. : 183-186
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
The Ideal Membership Problem in Non-Commutative Polynomial Rings
Journal of Symbolic Computation, Vol. 22, Iss. 1, 1996-01 ,pp. :
Access to resources
Recommend
Regular closed sets of permutations
By Albert M.H. Atkinson M.D. Ruskuc N.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
Intersection theorem for finite permutations
By Blinovsky V.
Problems of Information Transmission, Vol. 47, Iss. 1, 2011-03 ,pp. :
Lyndon words, permutations and trees
Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. :
Routing Permutations on Graphs via Factors
Journal of Parallel and Distributed Computing, Vol. 54, Iss. 2, 1998-11 ,pp. :