Entity usage

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 #1 to #50.

Application of CAS to constructing schemes of superhigh order of accuracy for heat conduction equation: Label: en
Transformations of two cryptographic problems in terms of matrices: Label: en
Root finding and approximation approaches through neural networks: Label: en
Algebraic generalization: Label: en
The nearest polynomial with a given zero, revisited: Label: en
In memoriam: Label: en
GUAVA: Label: en
SAGE: Label: en
A note on a nearest polynomial with a given root: Label: en
Space-efficient evaluation of hypergeometric series: Label: en
Conjectural permutation decoding of some AG codes: Label: en
Factorization of multivariate polynomials by extended Hensel construction: Label: en
Towards more accurate separation bounds of empirical polynomials: Label: en
Distribution of the error in estimated numbers of fixed points of the discrete logarithm: Label: en
A theorem for separating close roots of a polynomial and its derivatives: Label: en
On the size of minimal blocking sets of Q(4; q ), for q = 5,7: Label: en
Not seeing the roots for the branches: Label: en
MKM: Label: en
Solving parametric linear systems: Label: en
Greedy algorithms for optimizing multivariate Horner schemes: Label: en
A comparison of methods for accurate summation: Label: en
Completing the L-th power in Z[x]: Label: en
Work with non-commutative variables in the reduce-2 system for analytical calculations: Label: en
Congruent numbers: Label: en
Computational algebra and algebraic curves: Label: en
Memory cache and lisp: Label: en
QEPCAD B: Label: en
Polynomial transformations of Tschirnhaus, Bring and Jerrard: Label: en
Symbolic computation of integrals by recurrence: Label: en
Contributions to constructive polynomial ideal theory XXIII: Label: en
Comparing the speed of programs for sparse polynomial multiplication: Label: en
A method for removing all intermediate terms from a given equation: Label: en
Computer algebra in the life sciences: Label: en
Overcoming the memory wall in symbolic algebra: Label: en
A formula for separating small roots of a polynomial: Label: en
Using computer algebra methods to determine the chemical dimension of finitely ramified Sierpinski carpets: Label: en
Geometric completion of differential systems using numeric-symbolic continuation: Label: en
Computer algebra: Label: en
The golden rule of complementary feedback: Label: en
Solving systems of algebraic equations: Label: en
Computing the minimal telescoper for sums of hypergeometric terms: Label: en
Enumeration in the Chevalley algebras: Label: en
Automatic derivation and implementation of signal processing algorithms: Label: en
Factoring a binary polynomial of degree over one million: Label: en
Homotopies and polynomial system solving I: Label: en
An extensible differential equation solver: Label: en
Numerical monsters: Label: en
An elementary solution of a minimax problem arising in algorithms for automatic mesh selection: Label: en
On computing a separating transcendence basis: Label: en
A note on the number of division steps in the Euclidean algorithm: Label: en