LEADER 03574nam 22004815 450 001 996466341703316 005 20200701043216.0 010 $a3-540-38756-0 024 7 $a10.1007/3-540-12868-9 035 $a(CKB)1000000000230317 035 $a(SSID)ssj0000322085 035 $a(PQKBManifestationID)11277388 035 $a(PQKBTitleCode)TC0000322085 035 $a(PQKBWorkID)10280784 035 $a(PQKB)10478739 035 $a(DE-He213)978-3-540-38756-5 035 $a(PPN)155213989 035 $a(EXLCZ)991000000000230317 100 $a20121227d1983 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Algebra$b[electronic resource] $eEUROCAL?83, European Computer Algebra Conference London, England, March 28?30, 1983 Proceedings /$fedited by J. A. van Hulzen 205 $a1st ed. 1983. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1983. 215 $a1 online resource (XIII, 306 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v162 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-12868-9 327 $aIntegration ? What do we want from the theory? -- The Euclidean algorithm for Gaussian integers -- Multi polynomial remainder sequence and its application to linear diophantine equations -- Towards mechanical solution of the Kahan ellipse problem I -- Automatically determining symmetries of ordinary differential equations -- Algebraic computation of the statistics of the solution of some nonlinear stochastic differential equations -- Characterization of a linear differential system with a regular singularity -- The Bath Concurrent LISP machine -- The ecology of LISP or the case for the preservation of the environment -- The design of Maple: A compact, portable, and powerful computer algebra system -- LISP compilation viewed as provable semantics preserving program transformation -- Implementing REDUCE on a microcomputer -- A note on the complexity of constructing Gröbner-bases -- Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations -- The computation of the Hilbert function -- An algorithm for constructing detaching bases in the ring of polynomials over a field -- On the problem of Beh? Edd?n 'Am?l? and the computation of height functions -- A procedure for determining algebraic integers of given norm -- Computation of integral solutions of a special type of systems of quadratic equations -- Factorisation of sparse polynomials -- Early detection of true factors in univariate polynomial factorization -- On the complexity of finding short vectors in integer lattices -- Factoring polynomials over algebraic number fields -- The construction of a complete minimal set of contextual normal forms -- A knowledge-based approach to user-friendliness in symbolic computing -- Computer algebra and VLSI, prospects for cross fertilization -- Code optimization of multivariate polynomial schemes: A pragmatic approach. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v162 606 $aNumerical analysis 606 $aNumerical Analysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M14050 615 0$aNumerical analysis. 615 14$aNumerical Analysis. 676 $a518 702 $aHulzen$b J. A. van$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466341703316 996 $aComputer algebra$982804 997 $aUNISA