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.

A Characterization of Perfect Strategies for Mirror Games: Label: en
Efficient Generic Quotients Using Exact Arithmetic: Label: en
Elimination ideal and bivariate resultant over finite fields: Label: en
p-adic algorithm for bivariate Gröbner bases: Label: en
Refined telescoping algorithms in RΠΣ -extensions to reduce the degrees of the denominators✱: Label: en
New Characterization of the Factor Refinement Algorithm with Applications: Label: en
Exact computations with quasiseparable matrices: Label: en
SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials: Label: en
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology: Label: en
Faster real root decision algorithm for symmetric polynomials: Label: en
Sum of Squares Bounds for the Empty Integral Hull Problem: Label: en
A Unified Approach to Unimodality of Gaussian Polynomials: Label: en
Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares: Label: en
Factorization and root-finding for polynomials over division quaternion algebras: Label: en
The Membership Problem for Hypergeometric Sequences with Quadratic Parameters: Label: en
From Polynomial Invariants to Linear Loops: Label: en
Order bounds for C2-finite sequences: Label: en
Flip Graphs for Matrix Multiplication: Label: en
Transcendence Certificates for D-finite Functions: Label: en
On Isolating Roots in a Multiple Field Extension: Label: en
On the Order of Power Series and the Sum of Square Roots Problem: Label: en
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation: Label: en
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization: Label: en
Refined F5 Algorithms for Ideals of Minors of Square Matrices: Label: en
Universal Analytic Gröbner Bases and Tropical Geometry: Label: en
A Direttissimo Algorithm for Equidimensional Decomposition: Label: en
Using monodromy to recover symmetries of polynomial systems: Label: en
Computing Logarithmic Parts by Evaluation Homomorphisms✱: Label: en
Termination of linear loops under commutative updates: Label: en
Sensitivity analysis of discrete preference functions using Koszul simplicial complexes: Label: en
Lazard-style CAD and Equational Constraints: Label: en
Chinese Remainder Theorem for bivariate lexicographic Gröbner bases: Label: en
Blendstrings: an environment for computing with smooth functions: Label: en
Hyperelliptic Integrals to Elliptic Integrals: Label: en
Further results on the computation of the annihilators of integro-differential operators: Label: en
A New Black Box Factorization Algorithm - the Non-monic Case: Label: en
Stability Problems on D-finite Functions: Label: en
Hermite Reduction for D-finite Functions via Integral Bases: Label: en
Deciding first-order formulas involving univariate mixed trigonometric-polynomials: Label: en
An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function: Label: en
Isolating clusters of zeros of analytic systems using arbitrary-degree inflation: Label: en
Certified simultaneous isotopic approximation of pairs of curves via subdivision: Label: en
Real zeros of mixed random fewnomial systems: Label: en
Generalised cone complexes and tropical moduli in polymake: Label: en
Validated Root Enclosures for Interval Polynomials with Multiplicities: Label: en
Fast Algorithms for Discrete Differential Equations: Label: en
Beating binary powering for polynomial matrices: Label: en
An Algorithm to Enumerate Grid Signed Permutation Classes: Label: en
Moment Varieties for Mixtures of Products: Label: en
The Tropical Nullstellensatz and Positivstellensatz for Sparse Polynomial Systems: Label: en