Titlebook: Computer Algebra in Scientific Computing; CASC 2000 Victor G. Ganzha,Ernst W. Mayr,Evgenii V. Vorozhts Conference proceedings 2000 Springer

MORT

,Three Remarks on Comprehensive Gröbner and SAGBI Bases,ials, a general remark about CGB for parameterized binomial ideals, and it introduces the concept of comprehensive SAGBI bases together with a first application in invariant theory. .. Comprehensive Gröbner bases, parameterized binomial ideals, comprehensive SAGBI bases, algorithmic invariant theory, permutation groups.

牙齿

高射炮

negligence

Anna Yakovlieva,Sergii Boichenkoall I-homological model for commutative differential graded algebras (briefly, CDGAs). The complexity of the procedure is studied and a computer package in Mathematica is described for determining such models.

jarring

https://doi.org/10.1007/978-3-030-69189-9 organize in a logic manner the studies developed in different directions and we show how the modules obtained from these studies could cooperate in order to build IRONDEL, a Library for the Integration and Reduction of Ordinary Non linear Differential Equations.

充气女

拖债

https://doi.org/10.1007/978-3-642-57201-2Computeralgebra; Maple; Mathematica; algorithms; computer algebra; scientific computing; wissenschaftliche

吹气

incarcerate

Mark A. Krasnosel’skiǐ,Aleksei V. Pokrovskiǐo polynomials . and . (of degrees d. and d., respectively) along with their polynomial remainder sequence [1]. The computing time of our fast method is .(n.log ∥.∥.), for standard arithmetic and .(((n.+.. log ∥.∥)(log .+ log ∥.∥).) for the Chinese remainder method, where . = .. + .., ∥.∥ is the maxi

混合

Interdisciplinary Applied Mathematicse notion of zero-filiform Leibniz algebras and study their properties. There is a notion of .-filiform Lie algebras for .≥ 1 [3], which loses a sense in case . = 0, since Lie algebra has at least two generators. In the case of Leibniz algebras for . = 0 this notion substantial, and thereby, introduc