EUROSAM 84 : International Symposium on Symbolic and Algebraic Computation, Cambridge, England, July 9 11, 1984
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
174 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Symbolic and algebraic computation, EUROSAM 84, international symposium on ..., Cambridge, England, July 9-11, 1984, Berlin, Springer, 1984, 1 vol. (XI-396 p.), Lecture notes in computer science - LNCS, 3-540-13350-X • EUROSAM 84, Texte imprimé, 9783662172995 |
Indholdsfortegnelse:
- Homogeneous linear difference equation (Frobenius Boole method)
- An experiment toward a general quadrature for second order linear ordinary differential equations by symbolic computation
- Operational calculus techniques for solving differential equations
- On the application of symbolic computation to nonlinear control theory
- Quartic equations and algorithms for riemann tensor classification
- Symbolic computation and the Dirichlet problem
- Simplification of polynomials in n variables
- On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems
- Implementation of a p-adic package for polynomial factorization and other related operations
- Computations on curves
- Detecting torsion divisors on curves of genus 2
- Computation in radical extensions
- A primer: 11 Keys to new scratchpad
- A pure and really simple initial functional algebraic language
- Some effectivity problems in polynomial ideal theory
- Upper and lower bounds for the degree of Groebner bases
- On the complexity of the Gröbner-bases algorithm over K[x,y,z]
- Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings
- Computations with rational subsets of confluent groups
- Camac2: A portable system for combinatorial and algebraic computation
- Polynomial time algorithms for Galois groups
- Code generation and optimization for finite element analysis
- A comparison of algorithms for the symbolic computation of Padé approximants
- Automatic error cumulation control
- Polynomial factorization by root approximation
- Effective Hilbert irreducibility
- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
- A new lifting process for the multivariate polynomial factorization
- Explicit construction ofthe hilbert class fields of imaginary quadratic fields with class numbers 7 and 11
- On a simple primality testing algorithm
- A criterion for the equivalence of two ideals
- y?+fy=g
- Integration in finite terms with special functions: A progress report
- A note on the Risch differential equation
- Approximation by continued fraction of a polynomial real root
- On the automatic resolution of certain diophantine equations
- On pseudo-resultants.