Space Complexity and Word Problems of Groups
Lakin, Stephen R.; Thomas, Richard M.
2009-10-01 00:00:00
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.
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pngGroups - Complexity - Cryptologyde Gruyterhttp://www.deepdyve.com/lp/de-gruyter/space-complexity-and-word-problems-of-groups-2t9Uj23TH5
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.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.