Permutation group algorithms /:
"The central theme is the description of nearly linear-time algorithms, which are extremely fast in terms of both asymptotic analysis and practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear-time algo...
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: | Volltext |
| Zusammenfassung: | "The central theme is the description of nearly linear-time algorithms, which are extremely fast in terms of both asymptotic analysis and practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear-time algorithms." "The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory and is suitable for advanced graduate courses."--Jacket |
| Beschreibung: | 1 online resource (ix, 264 pages) |
| Bibliographie: | Includes bibliographical references (pages 254-261) and index. |
| ISBN: | 052166103X 9780521661034 0511066473 9780511066474 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocm70746506 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 020213s2003 nyu ob 001 0 eng d | ||
| 040 | |a REDDC |b eng |e pn |c REDDC |d BAKER |d OCLCG |d OCLCQ |d N$T |d OCLCQ |d MERUC |d CCO |d E7B |d OCLCQ |d FVL |d OCLCQ |d OCLCF |d DKDLA |d OCLCO |d OCLCQ |d YDXCP |d OCLCQ |d AZK |d CNNLC |d INTCL |d JBG |d COCUF |d AGLDB |d CNNOR |d MOR |d PIFBR |d OCLCQ |d BRL |d WRM |d VTS |d NRAMU |d CRU |d OCLCQ |d MOQ |d INT |d VT2 |d OCLCQ |d WYU |d G3B |d OCLCQ |d STF |d K6U |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d SFB |d OCLCQ | ||
| 019 | |a 57146432 |a 559434434 |a 646724681 |a 722320214 |a 728021551 |a 888766642 |a 961547285 |a 962561939 |a 1037477119 | ||
| 020 | |a 052166103X | ||
| 020 | |a 9780521661034 | ||
| 020 | |a 0511066473 |q (electronic bk.) | ||
| 020 | |a 9780511066474 |q (electronic bk.) | ||
| 035 | |a (OCoLC)70746506 |z (OCoLC)57146432 |z (OCoLC)559434434 |z (OCoLC)646724681 |z (OCoLC)722320214 |z (OCoLC)728021551 |z (OCoLC)888766642 |z (OCoLC)961547285 |z (OCoLC)962561939 |z (OCoLC)1037477119 | ||
| 050 | 4 | |a QA175 |b .S47 2003eb | |
| 072 | 7 | |a MAT |x 014000 |2 bisacsh | |
| 082 | 7 | |a 512/.2 |2 21 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Seress, Ákos, |d 1958- |1 https://id.oclc.org/worldcat/entity/E39PBJx4tRTgb8KFMwq98HYVmd |0 http://id.loc.gov/authorities/names/n00006356 | |
| 245 | 1 | 0 | |a Permutation group algorithms / |c Ákos Seress. |
| 260 | |a New York : |b Cambridge University Press, |c 2003. | ||
| 300 | |a 1 online resource (ix, 264 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a data file | ||
| 490 | 1 | |a Cambridge tracts in mathematics ; |v 152 | |
| 504 | |a Includes bibliographical references (pages 254-261) and index. | ||
| 505 | 0 | |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. | |
| 588 | 0 | |a Print version record. | |
| 520 | |a "The central theme is the description of nearly linear-time algorithms, which are extremely fast in terms of both asymptotic analysis and practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear-time algorithms." "The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory and is suitable for advanced graduate courses."--Jacket | ||
| 650 | 0 | |a Permutation groups. |0 http://id.loc.gov/authorities/subjects/sh85099993 | |
| 650 | 0 | |a Algorithms. |0 http://id.loc.gov/authorities/subjects/sh85003487 | |
| 650 | 2 | |a Algorithms |0 https://id.nlm.nih.gov/mesh/D000465 | |
| 650 | 6 | |a Groupes de permutations. | |
| 650 | 6 | |a Algorithmes. | |
| 650 | 7 | |a algorithms. |2 aat | |
| 650 | 7 | |a MATHEMATICS |x Group Theory. |2 bisacsh | |
| 650 | 7 | |a Algorithms |2 fast | |
| 650 | 7 | |a Permutation groups |2 fast | |
| 655 | 0 | |a Electronic books. | |
| 655 | 4 | |a Electronic books. | |
| 776 | 0 | 8 | |i Print version: |a Seress, Ákos, 1958- |t Permutation group algorithms. |d New York : Cambridge University Press, 2003 |w (DLC) 2002022291 |
| 830 | 0 | |a Cambridge tracts in mathematics ; |v 152. |0 http://id.loc.gov/authorities/names/n42005726 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=120693 |3 Volltext |
| 936 | |a BATCHLOAD | ||
| 938 | |a Baker & Taylor |b BKTY |c 80.00 |d 80.00 |i 052166103X |n 0003832519 |s active | ||
| 938 | |a ebrary |b EBRY |n ebr10069986 | ||
| 938 | |a EBSCOhost |b EBSC |n 120693 | ||
| 938 | |a YBP Library Services |b YANK |n 2617795 | ||
| 938 | |a YBP Library Services |b YANK |n 2825959 | ||
| 938 | |a YBP Library Services |b YANK |n 3276209 | ||
| 938 | |a YBP Library Services |b YANK |n 7292321 | ||
| 938 | |a YBP Library Services |b YANK |n 2301403 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocm70746506 |
|---|---|
| _version_ | 1816881638480543744 |
| adam_text | |
| any_adam_object | |
| author | Seress, Ákos, 1958- |
| author_GND | http://id.loc.gov/authorities/names/n00006356 |
| author_facet | Seress, Ákos, 1958- |
| author_role | |
| author_sort | Seress, Ákos, 1958- |
| author_variant | a s as |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA175 |
| callnumber-raw | QA175 .S47 2003eb |
| callnumber-search | QA175 .S47 2003eb |
| callnumber-sort | QA 3175 S47 42003EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | 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. |
| ctrlnum | (OCoLC)70746506 |
| 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>03961cam a2200673 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocm70746506 </controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cn|||||||||</controlfield><controlfield tag="008">020213s2003 nyu ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">REDDC</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">REDDC</subfield><subfield code="d">BAKER</subfield><subfield code="d">OCLCG</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">N$T</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">MERUC</subfield><subfield code="d">CCO</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">FVL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">DKDLA</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AZK</subfield><subfield code="d">CNNLC</subfield><subfield code="d">INTCL</subfield><subfield code="d">JBG</subfield><subfield code="d">COCUF</subfield><subfield code="d">AGLDB</subfield><subfield code="d">CNNOR</subfield><subfield code="d">MOR</subfield><subfield code="d">PIFBR</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">BRL</subfield><subfield code="d">WRM</subfield><subfield code="d">VTS</subfield><subfield code="d">NRAMU</subfield><subfield code="d">CRU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">MOQ</subfield><subfield code="d">INT</subfield><subfield code="d">VT2</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">WYU</subfield><subfield code="d">G3B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">STF</subfield><subfield code="d">K6U</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">57146432</subfield><subfield code="a">559434434</subfield><subfield code="a">646724681</subfield><subfield code="a">722320214</subfield><subfield code="a">728021551</subfield><subfield code="a">888766642</subfield><subfield code="a">961547285</subfield><subfield code="a">962561939</subfield><subfield code="a">1037477119</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">052166103X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521661034</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511066473</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511066474</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)70746506</subfield><subfield code="z">(OCoLC)57146432</subfield><subfield code="z">(OCoLC)559434434</subfield><subfield code="z">(OCoLC)646724681</subfield><subfield code="z">(OCoLC)722320214</subfield><subfield code="z">(OCoLC)728021551</subfield><subfield code="z">(OCoLC)888766642</subfield><subfield code="z">(OCoLC)961547285</subfield><subfield code="z">(OCoLC)962561939</subfield><subfield code="z">(OCoLC)1037477119</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA175</subfield><subfield code="b">.S47 2003eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">014000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">512/.2</subfield><subfield code="2">21</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Seress, Ákos,</subfield><subfield code="d">1958-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJx4tRTgb8KFMwq98HYVmd</subfield><subfield code="0">http://id.loc.gov/authorities/names/n00006356</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="260" ind1=" " ind2=" "><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 resource (ix, 264 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">data file</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge tracts in mathematics ;</subfield><subfield code="v">152</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 254-261) and index.</subfield></datafield><datafield tag="505" ind1="0" 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="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"The central theme is the description of nearly linear-time algorithms, which are extremely fast in terms of both asymptotic analysis and practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear-time algorithms." "The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory and is suitable for advanced graduate courses."--Jacket</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Permutation groups.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85099993</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85003487</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Algorithms</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D000465</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Groupes de permutations.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithms.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">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="655" ind1=" " ind2="0"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Seress, Ákos, 1958-</subfield><subfield code="t">Permutation group algorithms.</subfield><subfield code="d">New York : Cambridge University Press, 2003</subfield><subfield code="w">(DLC) 2002022291</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Cambridge tracts in mathematics ;</subfield><subfield code="v">152.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n42005726</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=120693</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="936" ind1=" " ind2=" "><subfield code="a">BATCHLOAD</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Baker & Taylor</subfield><subfield code="b">BKTY</subfield><subfield code="c">80.00</subfield><subfield code="d">80.00</subfield><subfield code="i">052166103X</subfield><subfield code="n">0003832519</subfield><subfield code="s">active</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10069986</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">120693</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2617795</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2825959</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3276209</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7292321</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2301403</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Electronic books. |
| genre_facet | Electronic books. |
| id | ZDB-4-EBA-ocm70746506 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-27T13:15:54Z |
| institution | BVB |
| isbn | 052166103X 9780521661034 0511066473 9780511066474 |
| language | English |
| oclc_num | 70746506 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (ix, 264 pages) |
| psigel | ZDB-4-EBA |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | Cambridge tracts in mathematics ; |
| series2 | Cambridge tracts in mathematics ; |
| spelling | Seress, Ákos, 1958- https://id.oclc.org/worldcat/entity/E39PBJx4tRTgb8KFMwq98HYVmd http://id.loc.gov/authorities/names/n00006356 Permutation group algorithms / Ákos Seress. New York : Cambridge University Press, 2003. 1 online resource (ix, 264 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier data file Cambridge tracts in mathematics ; 152 Includes bibliographical references (pages 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. Print version record. "The central theme is the description of nearly linear-time algorithms, which are extremely fast in terms of both asymptotic analysis and practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear-time algorithms." "The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory and is suitable for advanced graduate courses."--Jacket Permutation groups. http://id.loc.gov/authorities/subjects/sh85099993 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Algorithms https://id.nlm.nih.gov/mesh/D000465 Groupes de permutations. Algorithmes. algorithms. aat MATHEMATICS Group Theory. bisacsh Algorithms fast Permutation groups fast Electronic books. Print version: Seress, Ákos, 1958- Permutation group algorithms. New York : Cambridge University Press, 2003 (DLC) 2002022291 Cambridge tracts in mathematics ; 152. http://id.loc.gov/authorities/names/n42005726 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=120693 Volltext |
| spellingShingle | Seress, Ákos, 1958- Permutation group algorithms / Cambridge tracts in mathematics ; 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. Permutation groups. http://id.loc.gov/authorities/subjects/sh85099993 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Algorithms https://id.nlm.nih.gov/mesh/D000465 Groupes de permutations. Algorithmes. algorithms. aat MATHEMATICS Group Theory. bisacsh Algorithms fast Permutation groups fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85099993 http://id.loc.gov/authorities/subjects/sh85003487 https://id.nlm.nih.gov/mesh/D000465 |
| 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 | Permutation groups. http://id.loc.gov/authorities/subjects/sh85099993 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Algorithms https://id.nlm.nih.gov/mesh/D000465 Groupes de permutations. Algorithmes. algorithms. aat MATHEMATICS Group Theory. bisacsh Algorithms fast Permutation groups fast |
| topic_facet | Permutation groups. Algorithms. Algorithms Groupes de permutations. Algorithmes. algorithms. MATHEMATICS Group Theory. Permutation groups Electronic books. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=120693 |
| work_keys_str_mv | AT seressakos permutationgroupalgorithms |