ALTRAN

swMATH1203MaRDI QIDQ13944FDOQ13944

Author name not available (Why is that?)

Cited In (34)

• Title not available (Why is that?)
• Algebraic simplification
• Self-dual codes over GF(4)
• Error-Correcting Codes and Invariant Theory: New Applications of a Nineteenth-Century Technique
• Sparse polynomial division using a heap
• POLY: A New Polynomial Data Structure for Maple 17
• The Optimal Lattice Quantizer in Three Dimensions
• Computers and structures: Non-numerical applications
• A structure theorem for the elementary functions and its application to the identity problem
• Construction of fully symmetric cubature formulae of degree 4k-3 for fully symmetric planar regions
• On the classification and enumeration of self-dual codes
• Title not available (Why is that?)
• Some applications of computerized symbolic manipulation in the analysis of chemical engineering systems
• Solution of the equations associated with rational Runge-Kutta methods of orders up to four
• Analytical solutions for a class of nonlinear differential equations using altran
• The unimodular lattices of dimension up to 23 and the Minkowski-Siegel mass constants
• First Partial Differentiation by Computer with an Application to Categorical Data Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the sensitivity of the coefficients of Padé approximants with respect to their defining power series coefficients
• Sparse polynomial arithmetic with the BPAS library
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Legendre Polynomial Integral
• Most primitive groups have messy invariants
• Self-dual codes over GF(5)
• Conditions for cubic spline interpolation on triangular elements
• Nested Dissection of a Regular Finite Element Mesh
• Construction of cubature formulas of degree eleven for symmetric planar regions, using orthogonal polynomials
• Parameter identification of the Calvin photosynthesis cycle
• Another polynomial homomorphism
• Weight enumerators of self-orthogonal codes
• A procedure to obtain the initial amplitude and phase for the Krylov- Bogoliubov method
• Comparing the speed of programs for sparse polynomial multiplication

This page was built for software: ALTRAN