Kronecker
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Deformation techniques for sparse systems
- Evaluation techniques for zero-dimensional primary decomposition
- Generators of the ideal of an algebraic space curve
- Dagwood
- DEMiCs
- Epsilon
- FGb
- LiDIA
- Mathemagix
- DifferentialElimination
- Projective Noether
- RAGlib
- RegularChains
- Foveal detection and approximation for singularities.
- Fast algorithms for zero-dimensional polynomial systems using duality
- The hardness of polynomial equation solving
- Resolvent representation for regular differential ideals
- The Projective Noether Maple Package: Computing the dimension of a projective variety
- Some speed-ups and speed limits for real algebraic geometry
- Sparse resultants and straight-line programs
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Complexity of triangular representations of algebraic sets
- On the bit complexity of polynomial system solving
- On solving univariate sparse polynomials in logarithmic time
- Solving polynomial equations. Foundations, algorithms, and applications
- Functional programming concepts and straight-line programs in computer algebra
- Axel
- Quadratic Newton iteration for systems with multiplicity
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Complexity results for triangular sets
- The computational complexity of the Chow form
- modpn
- Juno-2
- Software engineering and complexity in effective algebraic geometry
- DISCOVERER
- ISOLATE
- Homotopy techniques for solving sparse column support determinantal polynomial systems
- Multilinear polynomial systems: root isolation and bit complexity
- Fast computation of generic bivariate resultants
- Certified non-conservative tests for the structural stability of discrete multidimensional systems
- Deterministic normal position transformation and its applications
- On Bézout inequalities for non-homogeneous polynomial ideals
- CSM-A
- DIFFALG
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- Computing critical points for invariant algebraic systems
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- A generalization of the Boulier-Buchberger criterion for the computation of characteristic sets of differential ideals
- GC
- Real root finding for low rank linear matrices
- Bertini_real
- Computing real radicals and S-radicals of polynomial systems
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- Solving determinantal systems using homotopy techniques
- Elimination for generic sparse polynomial systems
- Intrinsic complexity estimates in polynomial optimization
- Complexity of solving parametric polynomial systems
- Fast multivariate multi-point evaluation revisited
- On types of degenerate critical points of real polynomial functions
- brnoeth.lib
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
- Accelerated tower arithmetic
- Degeneracy loci and polynomial equation solving
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Stable normal forms for polynomial system solving
- Generalized polar varieties: geometry and algorithms
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Multistationarity in structured reaction networks
- Improved complexity bounds for counting points on hyperelliptic curves
- Efficient polynomial system-solving by numerical methods
- Testing sign conditions on a multivariate polynomial and applications
- Change of order for regular chains in positive dimension
- On the complexity of the resolvent representation of some prime differential ideals
- Rational univariate reduction via toric resultants
- MILONGA
- A probabilistic algorithm for computing data-discriminants of likelihood equations
- RationalFirstintegrals
- On the complexity exponent of polynomial system solving
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
- Weak identifiability for differential algebraic systems
- Algebraic geometry over four rings and the frontier to tractability.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Geomsolvex
- Exact algorithms for linear matrix inequalities
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
- SPECTRA
- Deterministic root finding over finite fields using Graeffe transforms
- Fast multivariate power series multiplication in characteristic zero
- Efficient polynomial system solving by numerical methods
- CharacteristicClasses
- FMPIntersectionTheory
- ANewDsc
- Solving bivariate systems using rational univariate representations
- SLV
- insulate
- Fast computation of a rational point of a variety over a finite field
- scientific article; zbMATH DE number 5124810 (Why is no real title available?)
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- A survey on the complexity of solving algebraic systems
This page was built for software: Kronecker
