Cited in
(only showing first 100 items - show all)- Solving polynomial systems equation by equation
- The computational complexity of the Chow form
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Deformation techniques to solve generalised Pham systems
- Software engineering and complexity in effective algebraic geometry
- Some speed-ups and speed limits for real algebraic geometry
- Fast algorithms for zero-dimensional polynomial systems using duality
- Resolvent representation for regular differential ideals
- On solving systems of bivariate polynomials
- Evaluation techniques for zero-dimensional primary decomposition
- Segre class computation and practical applications
- Stable normal forms for polynomial system solving
- Solving polynomial equations. Foundations, algorithms, and applications
- Functional programming concepts and straight-line programs in computer algebra
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- Generalized polar varieties: geometry and algorithms
- Computing isolated roots of sparse polynomial systems in affine space
- On the complexity of the resolvent representation of some prime differential ideals
- scientific article; zbMATH DE number 2151204 (Why is no real title available?)
- On the topology of real algebraic plane curves
- Complexity results for triangular sets
- Generalized polar varieties and an efficient real elimination.
- scientific article; zbMATH DE number 5049913 (Why is no real title available?)
- On the complexity of the generalized MinRank problem
- tangent Graeffe
- scientific article; zbMATH DE number 5124810 (Why is no real title available?)
- Solving bivariate systems using rational univariate representations
- Dagwood
- DEMiCs
- Epsilon
- FGb
- LiDIA
- Mathemagix
- Efficient polynomial system-solving by numerical methods
- Projective Noether
- RAGlib
- RegularChains
- Axel
- modpn
- Juno-2
- DISCOVERER
- ISOLATE
- CSM-A
- DIFFALG
- GC
- Bertini_real
- brnoeth.lib
- MILONGA
- RationalFirstintegrals
- Geomsolvex
- SPECTRA
- Deformation techniques for sparse systems
- ANewDsc
- CharacteristicClasses
- FMPIntersectionTheory
- SLV
- insulate
- Chordal
- SOS.m2
- FunEq
- libtropicana
- RS3
- COMBOS
- CylindricalAlgebraicDecompose
- Lgp
- F5C
- Deterministic root finding over finite fields using Graeffe transforms
- Quadratic Newton iteration for systems with multiplicity
- SegreClasses
- ObservabilityTest
- msolve
- tinygb
- Complexity of solving parametric polynomial systems
- A geometric index reduction method for implicit systems of differential algebraic equations
- Modular equations for hyperelliptic curves
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- FGb: A Library for Computing Gröbner Bases
- Multistationarity in structured reaction networks
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- A Gröbner free alternative for polynomial system solving
- Variant quantifier elimination
- Modular composition modulo triangular sets and applications
- Relaxed algorithms for \(p\)-adic numbers
- A probabilistic algorithm to test local algebraic observability in polynomial time
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- The hardness of polynomial equation solving
- Separating linear forms and rational univariate representations of bivariate systems
- Testing sign conditions on a multivariate polynomial and applications
- The Projective Noether Maple Package: Computing the dimension of a projective variety
- Bit-size estimates for triangular sets in positive dimension
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
- scientific article; zbMATH DE number 1745032 (Why is no real title available?)
- Foveal detection and approximation for singularities.
- A survey on the complexity of solving algebraic systems
- Efficient polynomial system solving by numerical methods
- Elimination for generic sparse polynomial systems
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
- Solving polynomial equation systems. Vol. III: Algebraic solving
- Symbolic computation in hyperbolic programming
This page was built for software: Kronecker
