LEADER 01004cam0 22002771 450 001 SOBE00024207 005 20210325101107.0 100 $a20120404d2000 |||||ita|0103 ba 101 $aita 102 $aIT 200 1 $aDue baci$fNiccolo Tommaseo$ga cura di Fabio Danelon 210 $aRoma$cSalerno$d2000 215 $a131 p.$d20 cm 225 2 $aFaville$v5 410 1$1001LAEC00023238$12001 $a*Faville$v5 700 1$aTommaseo$b, Niccolò$3AF00004840$4070$0337187 702 1$aDanelon, Fabio$3SOBA00003101$4070 801 0$aIT$bUNISOB$c20210325$gRICA 850 $aUNISOB 852 $aUNISOB$jFondo|De|Sanctis|F$m156266 912 $aSOBE00024207 940 $aM 102 Monografia moderna SBN 941 $aM 957 $aFondo|De|Sanctis|F$b000734$gCON$d156266$hDeSanctisF$rdono Prof.F.De Sanctis$1catenacci$2UNISOB$3UNISOB$420120404101643.0$520210325101107.0$6Spinosa$fPer le modalità di consultazione vedi homepage della Biblioteca link Fondi 996 $aDue baci$91718290 997 $aUNISOB LEADER 04847nam 2200565 450 001 996466112703316 005 20210330142739.0 010 $a3-540-87827-0 024 7 $a10.1007/978-3-540-87827-8 035 $a(CKB)1000000000490403 035 $a(SSID)ssj0000316876 035 $a(PQKBManifestationID)11231521 035 $a(PQKBTitleCode)TC0000316876 035 $a(PQKBWorkID)10287817 035 $a(PQKB)10863863 035 $a(DE-He213)978-3-540-87827-8 035 $a(MiAaPQ)EBC3063216 035 $a(MiAaPQ)EBC6408033 035 $a(PPN)129063142 035 $a(EXLCZ)991000000000490403 100 $a20210330d2008 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aComputer mathematics $e8th Asian symposium, ASCM 2007, Singapore, December 15-17, 2007 : revised and invited papers /$fDeepak Kapur (editor) 205 $a1st ed. 2008. 210 1$aBerlin ;$aHeidelberg :$cSpringer,$d[2008] 210 4$d©2008 215 $a1 online resource (XI, 359 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v5081 300 $a"... the Eighth Asian Symposium on Computer Mathematics (ASCM 2007)"--Pref. 311 $a3-540-87826-2 320 $aIncludes bibliographical references and index. 327 $aAlgorithms and Implementations -- Computing the Minkowski Value of the Exponential Function over a Complex Disk -- Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact -- The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval -- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping -- Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method? -- Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis -- Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix -- Efficient Algorithms for Computing N?ther Normalization -- Stability of GPBiCG_AR Method Based on Minimization of Associate Residual -- Evaluation of a Java Computer Algebra System -- A New Property of Hamming Graphs and Mesh of d-ary Trees -- Numerical Methods and Applications -- An Interpolation Method That Minimizes an Energy Integral of Fractional Order -- Solving Biomechanical Model Using Third-Order Runge-Kutta Methods -- An Efficient Fourth Order Implicit Runge-Kutta Algorithm for Second Order Systems -- Laplace Equation Inside a Cylinder: Computational Analysis and Asymptotic Behavior of the Solution -- A Method and Its Implementation for Constructing Bäcklund Transformations to Nonlinear Evolution Equations -- On the Invariant Properties of Hyperbolic Bivariate Third-Order Linear Partial Differential Operators -- Symbolic Solution to Magnetohydrodynamic Hiemenz Flow in Porous Media -- Local Similarity Solutions for Laminar Boundary Layer Flow along a Moving Cylinder in a Parallel Stream -- Elimination: Triangular Forms, Resultants, Equation Solving -- An Algorithm for Transforming Regular Chain into Normal Chain -- A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals -- Regular Decompositions -- Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation -- The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports -- Properties of Ascending Chains for Partial Difference Polynomial Systems -- Cryptology -- Some Mathematical Problems in Cryptanalysis -- A Reduction Attack on Algebraic Surface Public-Key Cryptosystems -- Computational Logic -- The Four Colour Theorem: Engineering of a Formal Proof -- On the Computation of Elimination Ideals of Boolean Polynomial Rings -- Computer Search for Large Sets of Idempotent Quasigroups. 330 $aThis book constitutes thoroughly refereed post-conference proceedings of the 8th Asian Symposium on Computer Mathematics, ASCM 2007, held in Singapore in December 2007. The 22 revised full papers and 5 revised poster papers presented together with 3 invited lectures were carefully selected during two rounds of reviewing and improvement from 65 submissions. The papers are organized in topical sections on algorithms and implementations, numerical methods and applications, cryptology, and computational logic. 410 0$aLecture Notes in Artificial Intelligence ;$v5081 606 $aComputer science$xMathematics$vCongresses 615 0$aComputer science$xMathematics 676 $a004.0151 702 $aKapur$b Deepak 712 12$aAsian Symposium on Computer Mathematics 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466112703316 996 $aComputer mathematics$9332121 997 $aUNISA