Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 50 results in range #101 to #150.
- A reduce package for series analysis by Hadamard's Theorem and QD schemes: Label: en
- Computing real zeros of polynomials with parametric coefficients: Label: en
- Statistics on factoring polynomials mod p and p-adically: Label: en
- Symbolic computation and number of zeros of a real parameter polynomial in the unit disk: Label: en
- Computer algebra on MIMD machine: Label: en
- A symbolic limit evaluation program in REDUCE: Label: en
- SCRATCHPAD/360: Label: en
- A solution to Kahan's problem (SIGSAM problem no. 9): Label: en
- A short note on a new method for polynomial real root isolation: Label: en
- A method for determining the coefficients of a reversed power series: Label: en
- The use of formula manipulation systems to compute asymptotic expansions: Label: en
- A comparative study of algorithms for sparse polynomial multiplication: Label: en
- A note on algebraic independence of logarithmic and exponential constants: Label: en
- How to find algebraic integers whose conjugates lie near the unit circle?: Label: en
- A note on the complexity of algebraic differentiation: Label: en
- Amthor's solution of Archimedes' cattle problem: Label: en
- Some problems connected with ambiguous expressions: Label: en
- Attempts in local simplification of non nested radicals: Label: en
- The impact of complexity theory on algorithms for sparse polynomials: Label: en
- An efficient squarefree decomposition algorithm: Label: en
- An algorithm for avoiding complex numbers in rational function integration: Label: en
- The Jacobi symbol algorithm: Label: en
- Recursive algorithm for the fast calculation of the limit of derivatives at points of indeterminateness: Label: en
- Saving space in coset enumeration: Label: en
- Efficient polynomial substitutions of a sparse argument: Label: en
- P-adic reconstruction of rational numbers: Label: en
- On the Budan-Fourier controversy: Label: en
- A novel symbolic ordinary differential equation solver: Label: en
- Lattices and factorization of polynomials: Label: en
- A general investigation of integration in finite form of differential equations of the first order article 1: Label: en
- Symbolic and algebraic computer programming systems: Label: en
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications: Label: en
- An application of reduce to industrial mechanics: Label: en
- State-space sets, state-space graphs and n-prefix expressions: Label: en
- Computational problems in producing taylor coefficients for the rotating disk problem: Label: en
- A simplified proof of the characterization theorem for Gröbner-bases: Label: en
- Problem 7 and systems of algebraic equations: Label: en
- Identifiability of compartmental models: Label: en
- Factorization of univariate polynomials: Label: en
- Computational problems in producing taylor coefficients for the rotating disk problem: Label: en
- The EEZ-GCD algorithm: Label: en
- A note about Laplace transform tables for computer use: Label: en
- Random oscillations arising in the MACSYMA implementation of Khachian-type algorithms in linear programming: Label: en
- Standard LISP report: Label: en
- Tests for polynomials: Label: en
- Anatomy of an integral: Label: en
- MACSYMA experiments with a modified Khachian-type algorithm in linear programming: Label: en
- Symbolic integration of expressions involving unspecified functions: Label: en
- Admissible term orderings used in computer algebra systems: Label: en
- Polynomial solution of recurrence relation and differential equation: Label: en