"The Complexity of Dehn's Algorithm for Word Problems in Groups."

Bernard Domanski, M. Anshel (1985)

> Home

Details and statistics

DOI: 10.1016/0196-6774(85)90031-8

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/DomanskiA85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/DomanskiA85
Bernard Domanski, M. Anshel:
The Complexity of Dehn's Algorithm for Word Problems in Groups. J. Algorithms 6(4): 543-549 (1985)

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.