Cited in
(76)- Chordal networks of polynomial ideals
- Doing algebraic geometry with the RegularChains library
- A concise proof of the Kronecker polynomial system solver from scratch
- Thomas decomposition of algebraic and differential systems
- On n-sectors of the angles of an arbitrary triangle
- A Maple Package for Automatic Theorem Proving and Discovery in 3D-Geometry
- Computing differential characteristic sets by change of ordering
- New exact solutions for higher-order nonlinear Schrödinger equation
- Solution of center-focus problem for a class of cubic systems
- scientific article; zbMATH DE number 2110642 (Why is no real title available?)
- Complexity of triangular representations of algebraic sets
- Automated theorem proving in GeoGebra: current achievements
- Multiplicity-preserving triangular set decomposition of two polynomials
- scientific article; zbMATH DE number 6440241 (Why is no real title available?)
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- On one method of proving inequalities in automated way
- On decomposition of algebraic PDE systems into simple subsystems
- scientific article; zbMATH DE number 5812809 (Why is no real title available?)
- Infinite orders and non-D-finite property of 3-dimensional lattice walks
- Computing intersection and self-intersection loci of parametrized surfaces using regular systems and Gröbner bases
- On protocols for the automated discovery of theorems in elementary geometry
- Symbolic computation of strongly nonlinear periodic oscillations
- Generic regular decompositions for parametric polynomial systems
- CASA
- Kronecker
- PGB
- Projective Noether
- RAEEM
- RATH
- RegularChains
- MEDLAR
- Cabri-geometry
- Geometry Expressions
- DISCOVERER
- BLAD
- DifferentialThomas
- Wsolve
- LocalizeRingForHomalg
- DDESpecialSolutions
- PDESpecialSolutions
- DifferentialAlgebra
- MILONGA
- Geometrix
- Chordal
- CAP
- COMBOS
- Stacks Project
- TDDS
- AlgebraicGeometryTools
- An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
- On computing absolutely irreducible components of algebraic varieties with parameters
- Complexity of solving parametric polynomial systems
- Generalizing the Steiner-Lehmus theorem using the Gröbner cover
- ATFM
- Symbolic computation of the orthogonal projection of rational curves onto rational parameterized surfaces
- Automated discovery of geometric theorems based on vector equations
- Algorithm for computing differential char sets efficiently
- Characteristic sets verses generalized characteristic sets
- A simple method for implicitizing rational curves and surfaces
- DifferentialElimination
- Symbolic computation of hyperbolic tangent solutions for nonlinear differential-difference equations
- An algorithmic approach to small limit cycles of nonlinear differential systems: the averaging method revisited
- Decomposition of polynomial sets into characteristic pairs
- Finding solutions of fuzzy polynomial equations systems by an Algebraic method
- Morley's theorem revisited: origami construction and automated proof
- Computing singular points of plane rational curves
- Locales
- Model reduction of chemical reaction systems using elimination
- Extension of Simson-Wallace theorem on skew quadrilaterals and further properties
- ZariskiFrames
- A normal form algorithm for regular differential chains
- A \textit{Maple} package for finding interaction solutions of nonlinear evolution equations
- Computational origami construction as constraint solving and rewriting
- Algebraic analysis of stability and bifurcation of a self-assembling micelle system
- An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
- Generic regular decompositions for generic zero-dimensional systems
This page was built for software: Epsilon
