| 000 | 02630nam a22003735i 4500 | ||
|---|---|---|---|
| 001 | 294315 | ||
| 003 | MX-SnUAN | ||
| 005 | 20160429155141.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 150903s2005 gw | o |||| 0|eng d | ||
| 020 |
_a9783540301370 _99783540301370 |
||
| 024 | 7 |
_a10.1007/b104035 _2doi |
|
| 035 | _avtls000347409 | ||
| 039 | 9 |
_a201509031108 _bVLOAD _c201405070454 _dVLOAD _y201402070931 _zstaff |
|
| 040 |
_aMX-SnUAN _bspa _cMX-SnUAN _erda |
||
| 050 | 4 | _aQA76.9.A43 | |
| 100 | 1 |
_aGerhard, Jürgen. _eautor _9327761 |
|
| 245 | 1 | 0 |
_aModular Algorithms in Symbolic Summation and Symbolic Integration / _cby Jürgen Gerhard. |
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2005. |
|
| 300 |
_axvI, 224 páginas Also available online. _brecurso en línea. |
||
| 336 |
_atexto _btxt _2rdacontent |
||
| 337 |
_acomputadora _bc _2rdamedia |
||
| 338 |
_arecurso en línea _bcr _2rdacarrier |
||
| 347 |
_aarchivo de texto _bPDF _2rda |
||
| 490 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v3218 |
|
| 500 | _aSpringer eBooks | ||
| 505 | 0 | _a1. Introduction -- 2. Overview -- 3. Technical Prerequisites -- 4. Change of Basis -- 5. Modular Squarefree and Greatest Factorial Factorization -- 6. Modular Hermite Integration -- 7. Computing All Integral Roots of the Resultant -- 8. Modular Algorithms for the Gosper-Petkovšek Form -- 9. Polynomial Solutions of Linear First Order Equations -- 10. Modular Gosper and Almkvist & Zeilberger Algorithms. | |
| 520 | _aThis book brings together two streams of computer algebra: symbolic summation and integration on the one hand, and fast algorithmics on the other hand. In symbolic integration and summation, not too many algorithms with analyzed run times are known, and until now the mathematically oriented world of integration and summation and the computer science world of algorithm analysis have not had much to say to each other. The progress presented in this work towards overcoming this situation is threefold: - a clear framework for algorithm analysis with the appropriate parameters is provided, - modular algorithmic techniques are introduced in this area, and - almost optimal algorithms are presented for the basic problems. | ||
| 590 | _aPara consulta fuera de la UANL se requiere clave de acceso remoto. | ||
| 710 | 2 |
_aSpringerLink (Servicio en línea) _9299170 |
|
| 776 | 0 | 8 |
_iEdición impresa: _z9783540240617 |
| 856 | 4 | 0 |
_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/b104035 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL) |
| 942 | _c14 | ||
| 999 |
_c294315 _d294315 |
||