Computer algebra : EUROCAL'83, European Computer Algebra Conference, London, England, March 28 30, 1983 : proceedings
Kaydedildi:
| Müşterek Yazar: | |
|---|---|
| Diğer Yazarlar: | |
| Materyal Türü: | Livre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seri Bilgileri: | Lecture notes in computer science
162 |
| Konular: | |
| Online Erişim: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Not: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Computer algebra, EUROCAL '83, European Computer Algebra Conference, London, England, March 28-30, 1983, edited by J.A. van Hulzen, Berlin, Springer-Verlag, 1983, 1 vol. (XII-305 p.), Lecture notes in computer science, 0-387-12868-9 • Computer Algebra, Texte imprimé, 9783540128687 • Computer Algebra, Texte imprimé, 9783662164075 |
İçindekiler:
- Integration 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 ofmultivariate polynomial schemes: A pragmatic approach.