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.

Computing minimal nullspace bases: Label: en
Factorization of differential operators with ordinary differential polynomial coefficients: Label: en
A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras: Label: en
Univariate real root isolation in multiple extension fields: Label: en
Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulas: Label: en
An efficient programming model for memory-intensive recursive algorithms using parallel disks: Label: en
Near optimal tree size bounds on a simple real root isolation algorithm: Label: en
Construction of 2-closed M-representations: Label: en
Effective de Rham cohomology: Label: en
When Newton meets Descartes: Label: en
Programming before theorizing, a case study: Label: en
Deterministic unimodularity certification: Label: en
An algorithm to compute the differential equations for the logarithm of a polynomial: Label: en
Border basis representation of a general quotient algebra: Label: en
Small homogeneous quandles: Label: en
Computing real solutions of polynomial systems via low-rank moment matrix completion: Label: en
An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme: Label: en
Algorithms for the universal decomposition algebra: Label: en
Zeilberger's holonomic ansatz for Pfaffians: Label: en
Rational invariants of scalings from Hermite normal forms: Label: en
On the complexity of multivariate blockwise polynomial multiplication: Label: en
Practical Gröbner basis computation: Label: en
Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions: Label: en
Improving the accuracy of linear programming solvers with iterative refinement: Label: en
Twisting q-holonomic sequences by complex roots of unity: Label: en
Solving polynomial systems globally invariant under an action of the symmetric group and application to the equilibria of N vortices in the plane: Label: en
Critical points and Gröbner bases: Label: en
On the complexity of solving a bivariate polynomial system: Label: en
Fast computation of Smith forms of sparse matrices over local rings: Label: en
Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values: Label: en
Telescopers for rational and algebraic functions via residues: Label: en
Order-degree curves for hypergeometric creative telescoping: Label: en
On the complexity of solving initial value problems: Label: en
Power series solutions of singular (q)-differential equations: Label: en
Fast computation of common left multiples of linear ordinary differential operators: Label: en
Compositions and collisions at degree p ²: Label: en
Parallel sparse polynomial multiplication on modern hardware architectures: Label: en
A polynomial time algorithm for computing the HNF of a module over the integers of a number field: Label: en
Solving polynomial systems over finite fields: Label: en
Relaxed p-adic Hensel lifting for algebraic systems: Label: en
Solving linear ordinary differential systems in hyperexponential extensions: Label: en
Computing closed form solutions of integrable connections: Label: en
A root isolation algorithm for sparse univariate polynomials: Label: en
The M4RIE library for dense linear algebra over small fields with even characteristic: Label: en
Computing Puiseux series for algebraic surfaces: Label: en
On valuations of meromorphic solutions of arbitrary-order linear difference systems with polynomial coefficients: Label: en
Elements of computer-algebraic analysis: Label: en
Upper bounds on real roots and lower bounds for the permanent: Label: en
Asymptotic spectrum and matrix multiplication: Label: en
Complexity of deciding connectivity in real algebraic sets: Label: en