A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
From MaRDI portal
Publication:272196
DOI10.1016/j.jco.2015.11.009zbMath1352.68299OpenAlexW2215141910MaRDI QIDQ272196
Publication date: 20 April 2016
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2015.11.009
Symbolic computation and algebraic computation (68W30) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items
Uniform Determinantal Representations, Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology, p-adic algorithm for bivariate Gröbner bases, Multilinear polynomial systems: root isolation and bit complexity, Fast computation of generic bivariate resultants, Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ISOLATE
- Solving bivariate systems using rational univariate representations
- Modular composition modulo triangular sets and applications
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Bit-size estimates for triangular sets in positive dimension
- Topology and arrangement computation of semi-algebraic planar curves
- Nearest multivariate system with given root multiplicities
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- Solving zero-dimensional systems through the rational univariate representation
- Isolated points, duality and residues
- Straight-line programs in geometric elimination theory
- Computing parametric geometric resolutions
- PRIMES is in P
- Sharp estimates for the arithmetic Nullstellensatz
- Quadratic Newton iteration for systems with multiplicity
- On the complexity of computing with zero-dimensional triangular sets
- On the complexity of computing with planar algebraic curves
- An improved upper complexity bound for the topology computation of a real algebraic plane curve
- Newton's method with deflation for isolated singularities of polynomial systems
- On the computational power of pushdown automata
- PARDI!
- Change of order for bivariate triangular sets
- Rational univariate representations of bivariate systems and applications
- Separating linear forms for bivariate systems
- On the complexity of solving bivariate systems
- Fast Polynomial Factorization and Modular Composition
- Improved algorithm for computing separating linear forms for bivariate systems
- Powers of tensors and fast matrix multiplication
- Fast Algorithms for Manipulating Formal Power Series
- Sharp estimates for triangular sets
- An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
- On the complexity of solving a bivariate polynomial system
- Lifting techniques for triangular decompositions
- Computing the multiplicity structure in solving polynomial systems
- Computing the multiplicity structure from geometric involutive form
- Computer Algebra in Scientific Computing
- Products of binomial coefficients and unreduced Farey fractions
- On Solving Systems of Bivariate Polynomials
- A Gröbner free alternative for polynomial system solving
