scientific article; zbMATH DE number 1254270

zbMath0918.14020MaRDI QIDQ4227319

Marie-Françoise Roy, Nikolaj N. jun. Vorob'ev

Publication date: 22 April 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexity of algorithmsmallest complex algebraic variety containing a given semialgebraic set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semialgebraic sets and related spaces (14P10)

Related Items (4)

On computing a set of points meeting every cell defined by a family of polynomials on a variety ⋮ Computing real radicals and \(S\)-radicals of polynomial systems ⋮ Generators for the \(C^m\)-closures of ideals ⋮ Computing roadmaps of semi-algebraic sets on a variety

This page was built for publication: