Language: English
Published by VDM Verlag Dr. Müller, 2009
ISBN 10: 3639138988 ISBN 13: 9783639138986
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Language: English
Published by VDM Verlag 5/15/2009, 2009
ISBN 10: 3639138988 ISBN 13: 9783639138986
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condition: New. Algorithmic Problems in the Braid Group. Book.
Language: English
Published by VDM Verlag Dr. Müller, 2009
ISBN 10: 3639138988 ISBN 13: 9783639138986
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 39.43
Quantity: Over 20 available
Add to basketCondition: New. In.
Language: English
Published by VDM Verlag Dr. Mïż½ller 2009-05-15, 2009
ISBN 10: 3639138988 ISBN 13: 9783639138986
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New.
Language: English
Published by VDM Verlag Dr. Müller, 2009
ISBN 10: 3639138988 ISBN 13: 9783639138986
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.
Language: English
Published by VDM Verlag Dr. Müller, 2009
ISBN 10: 3639138988 ISBN 13: 9783639138986
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Algorithmic Problems in the Braid Group | Theory and Applications | Elie Feder | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2009 | VDM Verlag Dr. Müller | EAN 9783639138986 | Verantwortliche Person für die EU: OmniScriptum GmbH & Co. KG, Bahnhofstr. 28, 66111 Saarbrücken, info[at]akademikerverlag[dot]de | Anbieter: preigu.
Language: English
Published by VDM Verlag Dr. Müller, 2009
ISBN 10: 3639138988 ISBN 13: 9783639138986
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 106.99
Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Language: English
Published by VDM Verlag Dr. M ller, 2009
ISBN 10: 3639138988 ISBN 13: 9783639138986
Seller: Mispah books, Redhill, SURRE, United Kingdom
paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Language: English
Published by VDM Verlag Dr. Müller, 2009
ISBN 10: 3639138988 ISBN 13: 9783639138986
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Language: English
Published by VDM Verlag Dr. Müller, 2009
ISBN 10: 3639138988 ISBN 13: 9783639138986
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Language: English
Published by VDM Verlag Dr. Müller, 2009
ISBN 10: 3639138988 ISBN 13: 9783639138986
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
£ 40.85
Quantity: Over 20 available
Add to basketPAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Language: English
Published by VDM Verlag Dr. Müller, 2009
ISBN 10: 3639138988 ISBN 13: 9783639138986
Seller: moluna, Greven, Germany
Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Feder ElieDr. Elie Feder received his Ph.D. from the Graduate Center of nCity University of New York (CUNY) in 2003. He is currently an nassistant professor at Kingsborough Community College of CUNY. nHis areas of research include: g.
Language: English
Published by VDM Verlag Dr. Müller, 2009
ISBN 10: 3639138988 ISBN 13: 9783639138986
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The study of braid groups and their applications is a field which has attracted the interest of mathematicians and computer scientists alike. We begin with a review of the notion of a braid group. We then discuss known solutions to decision problems in braid groups. We then prove new results in braid group algorithmics. We offer a quick solution to the generalized word problem in braid groups, in the special case of cyclic subgroups. We illustrate this solution using a multitape Turing machine. We then turn to a discussion of decision problems in cyclic amalgamations of groups and solve the word problem for the cyclic amalgamation of two braid groups. We then turn to a more general study of the conjugacy problem in cyclic amalgamations. We revise and prove some theorems of Lipschutz and show their application to cyclic amalgamations of braid groups. We generalize this application to prove a new theorem regarding the conjugacy problem in cyclic amalgamations. We then discuss some application of braid groups, culminating in a section devoted to the discussion of braid group cryptography.