An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation / J. Avenhaus, K. Madlener
Saved in:
Personal Name(s): | Avenhaus, Jürgen, author |
---|---|
Madlener, Klaus, author | |
Imprint: |
Kaiserslautern :
Universität Kaiserslautern,
1979
|
Physical Description: |
17 Seiten |
Note: |
englisch |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Interner Bericht / Universität Kaiserslautern Fachbereich Informatik ;
16 |
Classification: |
ZB | |
---|---|
Open Stacks Call number: S 005967-0016'01 Barcode: 1087003905 Available |