scientific article; zbMATH DE number 4212207
From MaRDI portal
Publication:3360296
zbMATH Open0733.13015MaRDI QIDQ3360296FDOQ3360296
Authors: Y. N. Lakshman, D. Lazard 
Publication date: 1991
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cited In (37)
- Title not available (Why is that?)
- Matrix-F5 algorithms over finite-precision complete discrete valuation fields
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Finding roots of a multivariate polynomial in a linear subspace
- Need polynomial systems be doubly-exponential?
- What can we do with a solution?
- A Gröbner free alternative for polynomial system solving
- Gröbner bases and cocyclic Hadamard matrices
- Determinantal formulae for the solution set of zero-dimensional ideals
- Title not available (Why is that?)
- Testing zero-dimensionality of varieties at a point
- Separation of the maximum isolated 0-dimensional component of the manifold of roots
- On the complexity exponent of polynomial system solving
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Straight-line programs in geometric elimination theory
- Polynomial complexity of solving systems of few algebraic equations with small degrees
- Title not available (Why is that?)
- Computing zero-dimensional tropical varieties via projections
- On product decomposition
- Sharper complexity bounds for zero-dimensional Gröbner bases and polynomial system solving
- The degree of a tropical basis
- Construction of roadmaps in semi-algebraic sets
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Robust algorithms for generalized Pham systems
- On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection
- Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
- A factorization algorithm for \(G\)-algebras and its applications
- On decomposing systems of polynomial equations with finitely many solutions
- On the computation of matrices of traces and radicals of ideals
- Test complexity of generic polynomials
- On radical zero-dimensional ideals
- Towards signature-based gröbner basis algorithms for computing the nondegenerate locus of a polynomial system
- Radical computations of zero-dimensional ideals and real root counting.
- Condition number based complexity estimate for solving polynomial systems
- Computing zero-dimensional schemes
- Solvability of systems of polynomial congruences modulo a large prime
- A note on upper bounds for ideal-theoretic problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3360296)
