Properness defects of projection and minimal discriminant variety
type: Item
instance of: scholarly article
title: Properness defects of projection and minimal discriminant variety
zbMATH Open document ID: 1235.13026
author: Guillaume Moroz
published in: Journal of Symbolic Computation
publication date: 2011-10-11T00:00:00Z
Mathematics Subject Classification ID: 13P25
Mathematics Subject Classification ID: 14N05
zbMATH DE Number: 5956347
zbMATH Keywords: parametric polynomial system
zbMATH Keywords: discriminant variety
zbMATH Keywords: elimination
zbMATH Keywords: deterministic complexity
describes a project that uses: Kronecker
describes a project that uses: RAGlib
MaRDI profile type: Publication
full work available at URL: j.jsc.2011.05.013
OpenAlex ID: W2071272143
cites work: Sum of roots with positive real parts
cites work: Triangular sets for solving polynomial systems: a comparative implementation of four methods
cites work: Algorithms in real algebraic geometry
cites work: On the complexity of computing syzygies
cites work: Q4693774
cites work: On using bi-equational constraints in CAD construction
cites work: A pure power product version of the Hilbert Nullstellensatz
cites work: Q5187264
cites work: Q4079605
cites work: Automated Deduction in Geometry
cites work: Q4023642
cites work: Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities
cites work: Q4352797
cites work: Lower bounds for diophantine approximations
cites work: Le rôle des structures de données dans les problèmes d'élimination
cites work: Straight-line programs in geometric elimination theory
cites work: A Gröbner free alternative for polynomial system solving
cites work: Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
cites work: Definability and fast quantifier elimination in algebraically closed fields
cites work: On the Theoretical and Practical Complexity of the Existential Theory of Reals
cites work: Quantifier Elimination for Formulas Constrained by Quadratic Equations via Slope Resultants
cites work: A complement of a hypersurface in affine variety.
cites work: Q4695324
cites work: A new method for solving algebraic systems of positive dimension
cites work: Solving parametric polynomial systems
cites work: The Space Complexity of Elimination Theory: Upper Bounds
cites work: The complexity of the word problems for commutative semigroups and polynomial ideals
cites work: Q4352783
cites work: Q1185456
cites work: Associative differential operations
cites work: Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
cites work: Testing sign conditions on a multivariate polynomial and applications
cites work: Complexity results for triangular sets
cites work: Mechanical theorem proving in geometries. Basic principles. Transl. from the Chinese by Xiaofan Jin and Dongming Wang
cites work: Computing triangular systems and regular systems
DOI: 10.1016/J.JSC.2011.05.013
description: scientific article; zbMATH DE number 5956347