default search action
"The Complexity of the Word Problem for Abelian l-Groups."
Volker Weispfenning (1986)
- Volker Weispfenning:
The Complexity of the Word Problem for Abelian l-Groups. Theor. Comput. Sci. 48(3): 127-132 (1986)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.