"Efficient Algorithms for Highly Compressed Data: The Word Problem in ..."

Jürn Laun (2014)

> Home

Details and statistics

DOI: 10.1007/S00224-013-9509-5

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/Laun14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/Laun14
Jürn Laun:
Efficient Algorithms for Highly Compressed Data: The Word Problem in Generalized Higman Groups Is in P. Theory Comput. Syst. 55(4): 742-770 (2014)

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.