<電子ブック>
EUROSAM 84 : International Symposium on Symbolic and Algebraic Computation, Cambridge, England, July 9-11, 1984 / edited by J. Fitch
(Lecture Notes in Computer Science. ISSN:16113349 ; 174)
版 | 1st ed. 1984. |
---|---|
出版者 | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer |
出版年 | 1984 |
本文言語 | 英語 |
大きさ | XI, 397 p : online resource |
著者標目 | Fitch, J editor SpringerLink (Online service) |
件 名 | LCSH:Computer science FREE:Computer Science |
一般注記 | 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 of the 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 HTTP:URL=https://doi.org/10.1007/BFb0032823 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
|
Springer eBooks | 9783540388937 |
|
電子リソース |
|
EB00224855 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA75.5-76.95 DC23:004 |
書誌ID | 4001088664 |
ISBN | 9783540388937 |