The following pages link to (Q4227319):
Displaying 12 items.
- A measure for semialgebraic sets related to Boolean complexity (Q1262914) (← links)
- Complexity of finding irreducible components of a semialgebraic set (Q1346599) (← links)
- On computing a set of points meeting every cell defined by a family of polynomials on a variety (Q1361873) (← links)
- Algorithms for Minkowski products and implicitly-defined complex sets (Q1569745) (← links)
- Computing with semi-algebraic sets: relaxation techniques and effective boundaries (Q1940931) (← links)
- Generators for the \(C^m\)-closures of ideals (Q2031505) (← links)
- Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311) (← links)
- Computation with semialgebraic sets represented by cylindrical algebraic formulas (Q2946521) (← links)
- (Q4038743) (← links)
- Computing roadmaps of semi-algebraic sets on a variety (Q4700178) (← links)
- (Q5460918) (← links)
- The complexification and degree of a semi-algebraic set. (Q5957310) (← links)
