A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
From MaRDI portal
Publication:272196
Recommendations
Cites work
- scientific article; zbMATH DE number 4132308 (Why is no real title available?)
- scientific article; zbMATH DE number 3620034 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1253962 (Why is no real title available?)
- scientific article; zbMATH DE number 1253989 (Why is no real title available?)
- scientific article; zbMATH DE number 1254248 (Why is no real title available?)
- scientific article; zbMATH DE number 578220 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 939802 (Why is no real title available?)
- scientific article; zbMATH DE number 5245181 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- An elimination method for solving bivariate polynomial systems: eliminating the usual drawbacks
- An improved upper complexity bound for the topology computation of a real algebraic plane curve
- Bit-size estimates for triangular sets in positive dimension
- Change of order for bivariate triangular sets
- Computer Algebra in Scientific Computing
- Computing parametric geometric resolutions
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Computing the multiplicity structure from geometric involutive form
- Computing the multiplicity structure in solving polynomial systems
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- Fast Algorithms for Manipulating Formal Power Series
- Fast polynomial factorization and modular composition
- ISOLATE
- Improved algorithm for computing separating linear forms for bivariate systems
- Isolated points, duality and residues
- Lifting techniques for triangular decompositions
- Modular composition modulo triangular sets and applications
- Nearest multivariate system with given root multiplicities
- Newton's method with deflation for isolated singularities of polynomial systems
- On solving systems of bivariate polynomials
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- On the complexity of computing with planar algebraic curves
- On the complexity of computing with zero-dimensional triangular sets
- On the complexity of solving a bivariate polynomial system
- On the complexity of solving bivariate systems
- On the computational power of pushdown automata
- PARDI!
- PRIMES is in P
- Powers of tensors and fast matrix multiplication
- Probabilistic algorithm for testing primality
- Products of binomial coefficients and unreduced Farey fractions
- Quadratic Newton iteration for systems with multiplicity
- Rational univariate representations of bivariate systems and applications
- Riemann's hypothesis and tests for primality
- Separating linear forms for bivariate systems
- Sharp estimates for the arithmetic Nullstellensatz
- Sharp estimates for triangular sets
- Solving bivariate systems using rational univariate representations
- Solving zero-dimensional systems through the rational univariate representation
- Straight-line programs in geometric elimination theory
- Topology and arrangement computation of semi-algebraic planar curves
Cited in
(7)- Multilinear polynomial systems: root isolation and bit complexity
- Fast computation of generic bivariate resultants
- p-adic algorithm for bivariate Gröbner bases
- Uniform Determinantal Representations
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology
This page was built for publication: A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q272196)
