Polynomial algorithms for problems in free groups based on Nielsen type arguments:
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | Undetermined |
Veröffentlicht: |
Kaiserslautern
Univ.
1980
|
Schriftenreihe: | Universität <Kaiserslautern>. Fachbereich Informatik: Interner Bericht.
31. |
Schlagworte: | |
Beschreibung: | 11 Bl. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV003366067 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 900725s1980 |||| 00||| und d | ||
035 | |a (DE-599)BVBBV003366067 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | |a und | ||
084 | |a SI 715 |0 (DE-625)143182: |2 rvk | ||
100 | 1 | |a Avenhaus, Jürgen |e Verfasser |4 aut | |
245 | 1 | 0 | |a Polynomial algorithms for problems in free groups based on Nielsen type arguments |c Jürgen Avenhaus ; Klaus Madlener* |
264 | 1 | |a Kaiserslautern |b Univ. |c 1980 | |
300 | |a 11 Bl. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Universität <Kaiserslautern>. Fachbereich Informatik: Interner Bericht. |v 31. | |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Freie Gruppe |0 (DE-588)4155283-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Gruppentheorie |0 (DE-588)4072157-7 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Gruppentheorie |0 (DE-588)4072157-7 |D s |
689 | 2 | |5 DE-604 | |
689 | 3 | 0 | |a Freie Gruppe |0 (DE-588)4155283-0 |D s |
689 | 3 | |5 DE-604 | |
700 | 1 | |a Madlener, Klaus |e Verfasser |4 aut | |
830 | 0 | |a Universität <Kaiserslautern>. Fachbereich Informatik: Interner Bericht. |v 31. |w (DE-604)BV000003819 |9 31. | |
999 | |a oai:aleph.bib-bvb.de:BVB01-002126297 |
Datensatz im Suchindex
_version_ | 1804117715956269056 |
---|---|
any_adam_object | |
author | Avenhaus, Jürgen Madlener, Klaus |
author_facet | Avenhaus, Jürgen Madlener, Klaus |
author_role | aut aut |
author_sort | Avenhaus, Jürgen |
author_variant | j a ja k m km |
building | Verbundindex |
bvnumber | BV003366067 |
classification_rvk | SI 715 |
ctrlnum | (DE-599)BVBBV003366067 |
discipline | Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01512nam a2200409 cb4500</leader><controlfield tag="001">BV003366067</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900725s1980 |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV003366067</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 715</subfield><subfield code="0">(DE-625)143182:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Avenhaus, Jürgen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Polynomial algorithms for problems in free groups based on Nielsen type arguments</subfield><subfield code="c">Jürgen Avenhaus ; Klaus Madlener*</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kaiserslautern</subfield><subfield code="b">Univ.</subfield><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11 Bl.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Universität <Kaiserslautern>. Fachbereich Informatik: Interner Bericht.</subfield><subfield code="v">31.</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Freie Gruppe</subfield><subfield code="0">(DE-588)4155283-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Gruppentheorie</subfield><subfield code="0">(DE-588)4072157-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Gruppentheorie</subfield><subfield code="0">(DE-588)4072157-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Freie Gruppe</subfield><subfield code="0">(DE-588)4155283-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Madlener, Klaus</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Universität <Kaiserslautern>. Fachbereich Informatik: Interner Bericht.</subfield><subfield code="v">31.</subfield><subfield code="w">(DE-604)BV000003819</subfield><subfield code="9">31.</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002126297</subfield></datafield></record></collection> |
id | DE-604.BV003366067 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T15:58:49Z |
institution | BVB |
language | Undetermined |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002126297 |
open_access_boolean | |
physical | 11 Bl. |
publishDate | 1980 |
publishDateSearch | 1980 |
publishDateSort | 1980 |
publisher | Univ. |
record_format | marc |
series | Universität <Kaiserslautern>. Fachbereich Informatik: Interner Bericht. |
series2 | Universität <Kaiserslautern>. Fachbereich Informatik: Interner Bericht. |
spelling | Avenhaus, Jürgen Verfasser aut Polynomial algorithms for problems in free groups based on Nielsen type arguments Jürgen Avenhaus ; Klaus Madlener* Kaiserslautern Univ. 1980 11 Bl. txt rdacontent n rdamedia nc rdacarrier Universität <Kaiserslautern>. Fachbereich Informatik: Interner Bericht. 31. Algorithmus (DE-588)4001183-5 gnd rswk-swf Freie Gruppe (DE-588)4155283-0 gnd rswk-swf Kombinatorik (DE-588)4031824-2 gnd rswk-swf Gruppentheorie (DE-588)4072157-7 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Kombinatorik (DE-588)4031824-2 s Gruppentheorie (DE-588)4072157-7 s Freie Gruppe (DE-588)4155283-0 s Madlener, Klaus Verfasser aut Universität <Kaiserslautern>. Fachbereich Informatik: Interner Bericht. 31. (DE-604)BV000003819 31. |
spellingShingle | Avenhaus, Jürgen Madlener, Klaus Polynomial algorithms for problems in free groups based on Nielsen type arguments Universität <Kaiserslautern>. Fachbereich Informatik: Interner Bericht. Algorithmus (DE-588)4001183-5 gnd Freie Gruppe (DE-588)4155283-0 gnd Kombinatorik (DE-588)4031824-2 gnd Gruppentheorie (DE-588)4072157-7 gnd |
subject_GND | (DE-588)4001183-5 (DE-588)4155283-0 (DE-588)4031824-2 (DE-588)4072157-7 |
title | Polynomial algorithms for problems in free groups based on Nielsen type arguments |
title_auth | Polynomial algorithms for problems in free groups based on Nielsen type arguments |
title_exact_search | Polynomial algorithms for problems in free groups based on Nielsen type arguments |
title_full | Polynomial algorithms for problems in free groups based on Nielsen type arguments Jürgen Avenhaus ; Klaus Madlener* |
title_fullStr | Polynomial algorithms for problems in free groups based on Nielsen type arguments Jürgen Avenhaus ; Klaus Madlener* |
title_full_unstemmed | Polynomial algorithms for problems in free groups based on Nielsen type arguments Jürgen Avenhaus ; Klaus Madlener* |
title_short | Polynomial algorithms for problems in free groups based on Nielsen type arguments |
title_sort | polynomial algorithms for problems in free groups based on nielsen type arguments |
topic | Algorithmus (DE-588)4001183-5 gnd Freie Gruppe (DE-588)4155283-0 gnd Kombinatorik (DE-588)4031824-2 gnd Gruppentheorie (DE-588)4072157-7 gnd |
topic_facet | Algorithmus Freie Gruppe Kombinatorik Gruppentheorie |
volume_link | (DE-604)BV000003819 |
work_keys_str_mv | AT avenhausjurgen polynomialalgorithmsforproblemsinfreegroupsbasedonnielsentypearguments AT madlenerklaus polynomialalgorithmsforproblemsinfreegroupsbasedonnielsentypearguments |