Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter March 10, 2010

Space Complexity and Word Problems of Groups

  • Stephen R. Lakin and Richard M. Thomas
From the journal Groups Complexity Cryptology
https://doi.org/10.1515/GCC.2009.261

This paper is concerned with the question of determining which groups have their word problems lying in a given complexity class. Our main results give sufficient conditions for the existence of groups whose word problem is contained in some specified space complexity class but is not contained in some other given space complexity class.

Received: 2009-07-01
Revised: 2009-11-10
Published Online: 2010-03-10
Published in Print: 2009-October

© Heldermann Verlag

From the journal
Groups Complexity Cryptology
Groups Complexity Cryptology
Volume 1 Issue 2

Journal and Issue

Articles in the same Issue

The Word and Conjugacy Problem for Shuffle Groups
Torsion-free Abelian Factor Groups of the Baumslag-Solitar Groups and Subgroups of the Additive Group of the Rational Numbers
Metabelian Product of a Free Nilpotent Group with a Free Abelian Group
Almost Locally Free Groups and a Theorem of Magnus: Some Questions
Authentication from Matrix Conjugation
The Tits Alternative for Tsaranov's Generalized Tetrahedron Groups
Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem
A Note on the Shifted Conjugacy Problem in Braid Groups
Algebraic Attacks Galore!
Space Complexity and Word Problems of Groups
A Practical Attack on a Certain Braid Group Based Shifted Conjugacy Authentication Protocol
Existence and Non-Existence of Torsion in Maximal Arithmetic Fuchsian Groups
Power-Commutative Nilpotent R-Powered Groups
On the Universal Theory of Torsion and Lacunary Hyperbolic Groups
Downloaded on 25.4.2024 from https://www.degruyter.com/document/doi/10.1515/GCC.2009.261/html
Scroll to top button