|
|
|
|
| LEADER |
01544nam a22003134a 4500 |
| 001 |
3d4b1d0e-898a-4203-b6c8-4265a224f76d |
| 005 |
20230617000000.0 |
| 008 |
110908s2011^^^^it^^^^^^^^^^^^001^0^eng^d |
| 020 |
|
|
|a 887642380X
|
| 020 |
|
|
|a 9788876423802
|
| 035 |
|
|
|a 752068453
|
| 040 |
|
|
|a BTCTA
|b eng
|c BTCTA
|d YDXCP
|d CDX
|d BWX
|d NDD
|
| 049 |
|
|
|a NDDP
|
| 050 |
|
4 |
|a QA161.P59
|b B65 2011
|
| 100 |
1 |
|
|a Boito, Paola
|
| 245 |
1 |
0 |
|a Structured matrix based methods for approximate polynomial GCD /
|c Paola Boito
|
| 260 |
|
|
|a Pisa :
|b Edizioni della Normale,
|c c2011
|
| 300 |
|
|
|a xvi, 199 p. ;
|c 24cm
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a unspecified
|b z
|2 rdamedia
|
| 338 |
|
|
|a unspecified
|b zu
|2 rdacarrier
|
| 490 |
1 |
|
|a Tesi/Theses ;
|v 15
|
| 504 |
|
|
|a Includes bibliographical references and index
|
| 505 |
0 |
0 |
|t Approximate polynomial GCD --
|t Structured and resultant matrices --
|t The Euclidean algorithm --
|t Matrix factorization and approximate GCDs --
|t Optimization approach --
|t New factorization-based methods --
|t A fast GCD algorithm --
|t Numerical tests --
|t Generalizations and further work
|
| 650 |
|
0 |
|a Divisor theory
|
| 650 |
|
0 |
|a Polynomials
|
| 830 |
|
0 |
|a Tesi (Pisa, Italy) ;
|v 15
|
| 999 |
1 |
0 |
|i 3d4b1d0e-898a-4203-b6c8-4265a224f76d
|l 005290917
|s US-NCD
|m structured_matrix_based_methods_for_approximate_polynomial_gcd_____________2011_______edizia________________________________________boito__paola_______________________p
|
| 999 |
1 |
1 |
|l 005290917
|s ISIL:US-NCD
|t BKS
|a PERKN PK
|b D04512853S
|c QA161.P59 B65 2011
|d 0
|x BOOK
|y 006066451
|p LOANABLE
|