Permutation group algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York
Cambridge University Press
2003
|
| Schriftenreihe: | Cambridge tracts in mathematics
152 |
| Schlagworte: | |
| Online-Zugang: | FAW01 FAW02 Volltext |
| Beschreibung: | Includes bibliographical references (p. 254-261) and index Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups |
| Beschreibung: | 1 Online-Ressource (ix, 264 p.) |
| ISBN: | 0511066473 052166103X 9780511066474 9780521661034 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043130517 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 151126s2003 |||| o||u| ||||||eng d | ||
| 020 | |a 0511066473 |c electronic bk. |9 0-511-06647-3 | ||
| 020 | |a 052166103X |9 0-521-66103-X | ||
| 020 | |a 9780511066474 |c electronic bk. |9 978-0-511-06647-4 | ||
| 020 | |a 9780521661034 |9 978-0-521-66103-4 | ||
| 035 | |a (OCoLC)70746506 | ||
| 035 | |a (DE-599)BVBBV043130517 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 |a DE-1047 | ||
| 082 | 0 | |a 512/.2 |2 21 | |
| 100 | 1 | |a Seress, Ákos |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Permutation group algorithms |c Ákos Seress |
| 264 | 1 | |a New York |b Cambridge University Press |c 2003 | |
| 300 | |a 1 Online-Ressource (ix, 264 p.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge tracts in mathematics |v 152 | |
| 500 | |a Includes bibliographical references (p. 254-261) and index | ||
| 500 | |a Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups | ||
| 650 | 7 | |a MATHEMATICS / Group Theory |2 bisacsh | |
| 650 | 7 | |a Algorithms |2 fast | |
| 650 | 7 | |a Permutation groups |2 fast | |
| 650 | 4 | |a Permutation groups | |
| 650 | 4 | |a Algorithms | |
| 650 | 0 | 7 | |a Algorithmische Gruppentheorie |0 (DE-588)4705829-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Permutationsgruppe |0 (DE-588)4173833-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Permutationsgruppe |0 (DE-588)4173833-0 |D s |
| 689 | 0 | 1 | |a Algorithmische Gruppentheorie |0 (DE-588)4705829-8 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=120693 |x Aggregator |3 Volltext |
| 912 | |a ZDB-4-EBA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028554708 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=120693 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=120693 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804175569336664064 |
|---|---|
| any_adam_object | |
| author | Seress, Ákos |
| author_facet | Seress, Ákos |
| author_role | aut |
| author_sort | Seress, Ákos |
| author_variant | á s ás |
| building | Verbundindex |
| bvnumber | BV043130517 |
| collection | ZDB-4-EBA |
| ctrlnum | (OCoLC)70746506 (DE-599)BVBBV043130517 |
| dewey-full | 512/.2 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 512 - Algebra |
| dewey-raw | 512/.2 |
| dewey-search | 512/.2 |
| dewey-sort | 3512 12 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02417nmm a2200517zcb4500</leader><controlfield tag="001">BV043130517</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151126s2003 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511066473</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">0-511-06647-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">052166103X</subfield><subfield code="9">0-521-66103-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511066474</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-0-511-06647-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521661034</subfield><subfield code="9">978-0-521-66103-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)70746506</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043130517</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512/.2</subfield><subfield code="2">21</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Seress, Ákos</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Permutation group algorithms</subfield><subfield code="c">Ákos Seress</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (ix, 264 p.)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Cambridge tracts in mathematics</subfield><subfield code="v">152</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. 254-261) and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Group Theory</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Permutation groups</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Permutation groups</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Gruppentheorie</subfield><subfield code="0">(DE-588)4705829-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Permutationsgruppe</subfield><subfield code="0">(DE-588)4173833-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Permutationsgruppe</subfield><subfield code="0">(DE-588)4173833-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmische Gruppentheorie</subfield><subfield code="0">(DE-588)4705829-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=120693</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028554708</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=120693</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=120693</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043130517 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:18:22Z |
| institution | BVB |
| isbn | 0511066473 052166103X 9780511066474 9780521661034 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028554708 |
| oclc_num | 70746506 |
| open_access_boolean | |
| owner | DE-1046 DE-1047 |
| owner_facet | DE-1046 DE-1047 |
| physical | 1 Online-Ressource (ix, 264 p.) |
| psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in mathematics |
| spelling | Seress, Ákos Verfasser aut Permutation group algorithms Ákos Seress New York Cambridge University Press 2003 1 Online-Ressource (ix, 264 p.) txt rdacontent c rdamedia cr rdacarrier Cambridge tracts in mathematics 152 Includes bibliographical references (p. 254-261) and index Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups MATHEMATICS / Group Theory bisacsh Algorithms fast Permutation groups fast Permutation groups Algorithms Algorithmische Gruppentheorie (DE-588)4705829-8 gnd rswk-swf Permutationsgruppe (DE-588)4173833-0 gnd rswk-swf Permutationsgruppe (DE-588)4173833-0 s Algorithmische Gruppentheorie (DE-588)4705829-8 s 1\p DE-604 http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=120693 Aggregator Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Seress, Ákos Permutation group algorithms MATHEMATICS / Group Theory bisacsh Algorithms fast Permutation groups fast Permutation groups Algorithms Algorithmische Gruppentheorie (DE-588)4705829-8 gnd Permutationsgruppe (DE-588)4173833-0 gnd |
| subject_GND | (DE-588)4705829-8 (DE-588)4173833-0 |
| title | Permutation group algorithms |
| title_auth | Permutation group algorithms |
| title_exact_search | Permutation group algorithms |
| title_full | Permutation group algorithms Ákos Seress |
| title_fullStr | Permutation group algorithms Ákos Seress |
| title_full_unstemmed | Permutation group algorithms Ákos Seress |
| title_short | Permutation group algorithms |
| title_sort | permutation group algorithms |
| topic | MATHEMATICS / Group Theory bisacsh Algorithms fast Permutation groups fast Permutation groups Algorithms Algorithmische Gruppentheorie (DE-588)4705829-8 gnd Permutationsgruppe (DE-588)4173833-0 gnd |
| topic_facet | MATHEMATICS / Group Theory Algorithms Permutation groups Algorithmische Gruppentheorie Permutationsgruppe |
| url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=120693 |
| work_keys_str_mv | AT seressakos permutationgroupalgorithms |