|
|
|
|
LEADER |
00000cam a2200000 a 4500 |
001 |
EBSCO_ocm70746506 |
003 |
OCoLC |
005 |
20231017213018.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
|
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.)
|
029 |
1 |
|
|a AU@
|b 000051401488
|
029 |
1 |
|
|a AU@
|b 000053246792
|
029 |
1 |
|
|a DEBBG
|b BV043130517
|
029 |
1 |
|
|a DEBSZ
|b 422359254
|
029 |
1 |
|
|a GBVCP
|b 802144160
|
029 |
1 |
|
|a NZ1
|b 12008419
|
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 |
0 |
4 |
|a 512/.2
|2 21
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Seress, Ákos,
|d 1958-
|
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
|
590 |
|
|
|a eBooks on EBSCOhost
|b EBSCO eBook Subscription Academic Collection - Worldwide
|
650 |
|
0 |
|a Permutation groups.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
2 |
|a Algorithms
|
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
|
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.
|
856 |
4 |
0 |
|u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=120693
|z Texto completo
|
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 IZTAP
|