Kronecker

swMATH495MaRDI QIDQ13252FDOQ13252

Author name not available (Why is that?)

Described by source

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

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

• A parametric representation of totally mixed Nash equilibria
• Change of order for regular chains in positive dimension
• Computing isolated roots of sparse polynomial systems in affine space
• A geometric index reduction method for implicit systems of differential algebraic equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the bit complexity of polynomial system solving
• 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
• Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
• 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
• On Solving Systems of Bivariate Polynomials
• 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
• 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
• Probabilistic algorithms for computing resolvent representations of regular differential ideals
• Deterministic root finding over finite fields using Graeffe transforms
• The hardness of polynomial equation solving
• Polynomial equation solving by lifting procedures for ramified fibers
• Relaxed algorithms for \(p\)-adic numbers
• The computational complexity of the Chow form
• Evaluation techniques for zero-dimensional primary decomposition
• The first rational Chebyshev knots
• Numerical Decomposition of the Rank-Deficiency Set of a Matrix of Multivariate Polynomials
• Quadratic Newton iteration for systems with multiplicity
• A probabilistic algorithm to test local algebraic observability in polynomial time
• On computing absolutely irreducible components of algebraic varieties with parameters
• A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
• Software engineering and complexity in effective algebraic geometry
• Complexity of solving parametric polynomial systems
• Title not available (Why is that?)
• On the complexity of the resolvent representation of some prime differential ideals
• A generalization of the Boulier-Buchberger criterion for the computation of characteristic sets of differential ideals
• Title not available (Why is that?)
• Separating linear forms and rational univariate representations of bivariate systems
• Generalized polar varieties: geometry and algorithms
• Title not available (Why is that?)
• On sign conditions over real multivariate polynomials
• On the complexity of the \(F_5\) Gröbner basis algorithm
• 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.
• FGb: A Library for Computing Gröbner Bases
• Testing sign conditions on a multivariate polynomial and applications
• Some speed-ups and speed limits for real algebraic geometry
• Segre class computation and practical applications
• On the complexity of the generalized MinRank problem
• Efficient polynomial system-solving by numerical methods
• Title not available (Why is that?)
• Generators of the ideal of an algebraic space curve
• Fast algorithms for zero-dimensional polynomial systems using duality
• Solving polynomial equations. Foundations, algorithms, and applications
• On the topology of real algebraic plane curves
• Polyhedral Methods in Numerical Algebraic Geometry
• Deformation techniques to solve generalised Pham systems
• The Projective Noether Maple Package: Computing the dimension of a projective variety
• Title not available (Why is that?)
• Multistationarity in structured reaction networks
• Functional programming concepts and straight-line programs in computer algebra
• On solving univariate sparse polynomials in logarithmic time
• Title not available (Why is that?)
• Variant quantifier elimination
• Stable normal forms for polynomial system solving
• Modular equations for hyperelliptic curves
• An algorithm for implicit interpolation
• Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
• Effective approximation of the solutions of algebraic equations
• Title not available (Why is that?)
• Solving determinantal systems using homotopy techniques
• Symbolic computation in hyperbolic programming
• Degeneracy loci and polynomial equation solving
• Multilinear polynomial systems: root isolation and bit complexity
• Systems of rational polynomial equations have polynomial size approximate zeros on the average
• Exact algorithms for semidefinite programs with degenerate feasible set
• Foveal detection and approximation for singularities.
• Accelerated tower arithmetic
• Fast computation of generic bivariate resultants
• Title not available (Why is that?)
• 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
• Improved complexity bounds for counting points on hyperelliptic curves
• Constraint Databases
• Blind algebraic identification of communication channels: symbolic solution algorithms
• Complexity of triangular representations of algebraic sets
• On Bézout inequalities for non-homogeneous polynomial ideals
• A probabilistic algorithm for computing data-discriminants of likelihood equations
• Evaluation properties of invariant polynomials

This page was built for software: Kronecker