Kronecker

swMATH495MaRDI QIDQ13252FDOQ13252

Author name not available (Why is that?)

Official website: https://www.lix.polytechnique.fr/~lecerf/software/kronecker/index.html

Described by source

• A concise proof of the Kronecker polynomial system solver from scratch

Cited In (only showing first 100 items - show all)

• Effective approximation of the solutions of algebraic equations
• 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
• Change of order for regular chains in positive dimension
• Multilinear polynomial systems: root isolation and bit complexity
• Systems of rational polynomial equations have polynomial size approximate zeros on the average
• Foveal detection and approximation for singularities.
• Accelerated tower arithmetic
• On the bit complexity of polynomial system solving
• Title not available (Why is that?)
• Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
• Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
• Constraint Databases
• Blind algebraic identification of communication channels: symbolic solution algorithms
• Complexity of triangular representations of algebraic sets
• 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
• Efficient polynomial system solving by numerical methods
• Probabilistic algorithms for computing resolvent representations of regular differential ideals
• Evaluation properties of invariant polynomials
• Polyhedral methods in numerical algebraic geometry
• Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
• Polynomial equation solving by lifting procedures for ramified fibers
• Computing critical points for invariant algebraic systems
• The first rational Chebyshev knots
• An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
• Fast computation of a rational point of a variety over a finite field
• Rational univariate reduction via toric resultants
• On computing absolutely irreducible components of algebraic varieties with parameters
• Title not available (Why is that?)
• A generalization of the Boulier-Buchberger criterion for the computation of characteristic sets of differential ideals
• Title not available (Why is that?)
• Real root finding for determinants of linear matrices
• On the complexity of the \(F_5\) Gröbner basis algorithm
• Computing real radicals and \(S\)-radicals of polynomial systems
• A generic position based method for real root isolation of zero-dimensional polynomial systems
• Relaxed Hensel lifting of triangular sets
• Algebraic geometry over four rings and the frontier to tractability.
• Elimination for generic sparse polynomial systems
• Generators of the ideal of an algebraic space curve
• Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
• Exact algorithms for linear matrix inequalities
• Sparse resultants and straight-line programs
• Fast multivariate multi-point evaluation revisited
• Real root finding for low rank linear matrices
• Title not available (Why is that?)
• DifferentialElimination
• Intrinsic complexity estimates in polynomial optimization
• Solving polynomial equation systems. Vol. III: Algebraic solving
• On solving univariate sparse polynomials in logarithmic time
• Fast multivariate power series multiplication in characteristic zero
• Homotopy techniques for solving sparse column support determinantal polynomial systems
• An algorithm for implicit interpolation
• Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
• Groebner.jl
• DetNorPos.mpl
• 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
• Solving parametric systems of polynomial equations over the reals through Hermite matrices
• Improved complexity bounds for counting points on hyperelliptic curves
• On Bézout inequalities for non-homogeneous polynomial ideals
• A probabilistic algorithm for computing data-discriminants of likelihood equations
• Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
• Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
• On types of degenerate critical points of real polynomial functions
• Weak identifiability for differential algebraic systems
• ResGrob.mpl
• Effective de Rham cohomology — The general case
• Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
• Computing isolated roots of sparse polynomial systems in affine space
• A geometric index reduction method for implicit systems of differential algebraic equations
• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
• Complexity results for triangular sets
• Solving bivariate systems using rational univariate representations
• Modular composition modulo triangular sets and applications
• Root isolation of zero-dimensional polynomial systems with linear univariate representation
• Title not available (Why is that?)
• Resolvent representation for regular differential ideals
• 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
• Title not available (Why is that?)
• Deformation techniques for sparse systems
• A Gröbner free alternative for polynomial system solving
• Deterministic root finding over finite fields using Graeffe transforms
• The hardness of polynomial equation solving
• Relaxed algorithms for \(p\)-adic numbers
• The computational complexity of the Chow form
• Evaluation techniques for zero-dimensional primary decomposition
• Solving polynomial systems equation by equation
• On solving systems of bivariate polynomials
• Generalized polar varieties and an efficient real elimination.
• Quadratic Newton iteration for systems with multiplicity
• A probabilistic algorithm to test local algebraic observability in polynomial time

This page was built for software: Kronecker