Cited in
(59)- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Absolute factoring of non-holonomic ideals in the plane
- Chebyshev interpolation polynomial-based tools for rigorous computing
- Parametric quantified SAT solving
- Algorithms for Bernstein-Sato polynomials and multiplier ideals
- Computing specified generators of structured matrix inverses
- Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case
- On some decidable and undecidable problems related to q-difference equations with parameters
- Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method
- Consistency of finite difference approximations for linear PDE systems and its algorithmic verification
- Degree bounds for Gröbner bases of low-dimensional polynomial ideals
- Decomposition of generic multivariate polynomials
- MABSys: Modeling and analysis of biological systems
- A Strassen-like matrix multiplication suited for squaring and higher power computation
- Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes
- Black-box/white-box simplification and applications to quantifier elimination
- Computation with semialgebraic sets represented by cylindrical algebraic formulas
- Randomized NP-completeness for p -adic rational roots of sparse polynomials in one variable
- Lagrangian curves in a 4-dimensional affine symplectic space
- On moving frames and Noether's conservation laws
- Solving recurrence relations using local invariants
- Iterative Toom-Cook methods for very unbalanced long integer multiplication
- Output-sensitive decoding for redundant residue systems
- Symbolic integration at compile time in finite element methods
- The DMM bound: multivariate (aggregate) separation bounds
- Isolde
- DIFFALG
- Milne
- Indiff
- MABSys
- STURM
- NumericalSchubertCalculus
- ExpandedLiePointSymmetry
- Global optimization of polynomials using generalized critical values and sums of squares
- Random polynomials and expected complexity of bisection methods for real solving
- Simultaneously row- and column-reduced higher-order linear differential systems
- Composition collisions and projective polynomials: statement of results
- Moving frames and conservation laws for Euclidean invariant Lagrangians
- A new algorithm for computing comprehensive Gröbner systems
- A slice algorithm for corners and Hilbert-Poincaré series of monomial ideals
- A new incremental algorithm for computing Groebner bases
- When can we detect that a P-finite sequence is positive?
- Liouvillian solutions of irreducible second order linear difference equations
- Partial denominator bounds for partial linear difference equations
- Real and complex polynomial root-finding with eigen-solving and preprocessing
- Finding all Bessel type solutions for linear differential equations with rational function coefficients
- Complexity of creative telescoping for bivariate rational functions
- Polynomial integration on regions defined by a triangle and a conic
- Blind image deconvolution via fast approximate GCD
- Triangular decomposition of semi-algebraic systems
- Solving Schubert problems with Littlewood-Richardson homotopies
- NumGfun: a package for numerical and analytic computation with D-finite functions
- Easy composition of symbolic computation software: a new lingua franca for symbolic computation
- A method for semi-rectifying algebraic and differential systems using scaling type Lie point symmetries with linear algebra
- Generating differential invariants
- Differential invariants of a Lie group action: syzygies on a generating set
- Differential invariants of surfaces
- An in-place truncated Fourier transform and applications to polynomial multiplication
- Computing the singularities of rational space curves
This page was built for software: AIDA
