Kronecker
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An algorithm for implicit interpolation
- Effective approximation of the solutions of algebraic equations
- Modular equations for hyperelliptic curves
- Effective de Rham cohomology — The general case
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- Solving determinantal systems using homotopy techniques
- A parametric representation of totally mixed Nash equilibria
- A survey on the complexity of solving algebraic systems
- Symbolic computation in hyperbolic programming
- Degeneracy loci and polynomial equation solving
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- Multilinear polynomial systems: root isolation and bit complexity
- Change of order for regular chains in positive dimension
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Foveal detection and approximation for singularities.
- Computing isolated roots of sparse polynomial systems in affine space
- A geometric index reduction method for implicit systems of differential algebraic equations
- Accelerated tower arithmetic
- On the bit complexity of polynomial system solving
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Fast computation of generic bivariate resultants
- Solving bivariate systems using rational univariate representations
- Complexity results for triangular sets
- Modular composition modulo triangular sets and applications
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
- Certified non-conservative tests for the structural stability of discrete multidimensional systems
- Deterministic normal position transformation and its applications
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- scientific article; zbMATH DE number 2151234 (Why is no real title available?)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- scientific article; zbMATH DE number 5124810 (Why is no real title available?)
- Resolvent representation for regular differential ideals
- Improved complexity bounds for counting points on hyperelliptic curves
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Bit-size estimates for triangular sets in positive dimension
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- Constraint Databases
- Blind algebraic identification of communication channels: symbolic solution algorithms
- Deformation techniques for sparse systems
- Complexity of triangular representations of algebraic sets
- scientific article; zbMATH DE number 5049913 (Why is no real title available?)
- On Bézout inequalities for non-homogeneous polynomial ideals
- A Gröbner free alternative for polynomial system solving
- A probabilistic algorithm for computing data-discriminants of likelihood equations
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Properness defects of projection and minimal discriminant variety
- On the complexity exponent of polynomial system solving
- Deterministic root finding over finite fields using Graeffe transforms
- Probabilistic algorithms for computing resolvent representations of regular differential ideals
- Evaluation properties of invariant polynomials
- Efficient polynomial system solving by numerical methods
- Polynomial equation solving by lifting procedures for ramified fibers
- The hardness of polynomial equation solving
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Polyhedral methods in numerical algebraic geometry
- Relaxed algorithms for \(p\)-adic numbers
- Evaluation techniques for zero-dimensional primary decomposition
- The computational complexity of the Chow form
- Computing critical points for invariant algebraic systems
- The first rational Chebyshev knots
- Rational univariate reduction via toric resultants
- Fast computation of a rational point of a variety over a finite field
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
- Quadratic Newton iteration for systems with multiplicity
- Solving polynomial systems equation by equation
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
- On solving systems of bivariate polynomials
- Generalized polar varieties and an efficient real elimination.
- Software engineering and complexity in effective algebraic geometry
- Dagwood
- DEMiCs
- Epsilon
- FGb
- LiDIA
- Mathemagix
- Projective Noether
- RAGlib
- RegularChains
- Axel
- modpn
- Juno-2
- DISCOVERER
- ISOLATE
- CSM-A
- DIFFALG
- GC
- Bertini_real
- brnoeth.lib
- MILONGA
- RationalFirstintegrals
- Geomsolvex
- SPECTRA
- ANewDsc
- CharacteristicClasses
- FMPIntersectionTheory
- SLV
- insulate
- Chordal
This page was built for software: Kronecker
