scientific article
From MaRDI portal
Publication:3952057
zbMath0491.00019MaRDI QIDQ3952057
No author found.
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Conference proceedings and collections of articles (00Bxx)
Related Items
Gröbner-Shirshov bases for some Lie algebras, Symbolic incidence geometry and finite linear spaces, Relative class number of imaginary Abelian fields of prime conductor below 10000, Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form, Computer algebra: Past and future, On mechanical quantifier elimination for elementary algebra and geometry, A bibliography of quantifier elimination for real closed fields, A cluster-based cylindrical algebraic decomposition algorithm, A canonical simplifier for trigonometric expressions in the kinematic equation, A polynomial-time algorithm for the topological type of real algebraic curve, Algebraic decomposition of regular curves, Checking properties of polynomials, Gröbner–Shirshov bases for Lie Ω-algebras and free Rota–Baxter Lie algebras, On the reduction of the normality conditions in equality-constrained optimization problems in mechanics, Cryptanalysis of the TRMS Signature Scheme of PKC’05, Gröbner-Shirshov bases for semirings., Some new results on Gröbner–Shirshov bases for Lie algebras and around, Generalized anti-commutative Gröbner-Shirshov basis theory and free Sabinin algebras, Gröbner-Shirshov bases for free Gelfand-Dorfman-Novokov algebras and for right ideals of free right Leibniz algebras, Gröbner-Shirshov bases for Lie algebras over a commutative algebra, New approaches to plactic monoid via Gröbner-Shirshov bases., An extended polynomial GCD algorithm using Hankel matrices, Local algebraic analysis of differential systems, A review of Mathematica, Polynomial computability of fields of algebraic numbers, Comprehensive Gröbner bases, Rank of a Hankel matrix over \({\mathbb{Z}{}} [x_ 1,{\cdots{}},x_ r\)], Gröbner–Shirshov bases and their calculation, A new Composition-Diamond lemma for associative conformal algebras, A method of proving the invariance of linear inequalities for linear loops, New algorithms for the perspective-three-point problem, Checking existence of solutions of partial differential equations in the fields of Laurent series, Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects, Implementing a computer algebra system in Haskell, Gröbner–Shirshov bases for brace algebras, The Computational Complexity of the Resolution of Plane Curve Singularities, An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography, Decidability of elementary theories of certain finitely defined algebras, The complexity of almost linear diophantine problems, Computing with groups and their character tables, Integration of rational functions: Rational computation of the logarithmic part, Notes on the complexity of exact view graph algorithms for piecewise smooth algebraic surfaces, Gröbner–Shirshov bases for commutative dialgebras, Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision, The predicates of the Apollonius diagram: algorithmic analysis and implementation, Identifiability and distinguishability testing via computer algebra, Symbolic and numeric methods for exploiting structure in constructing resultant matrices, Linear recurring sequences for computing the resultant of multivariate polynomials
