The Complexity of the Word Problem for Abelian l-Groups

Volker Weispfenning. The Complexity of the Word Problem for Abelian l-Groups. Theoretical Computer Science, 48(3):127-132, 1986.

Authors

Volker Weispfenning

This author has not been identified. Look up 'Volker Weispfenning' in Google