5 problems
- 0 votes0 replies1 view
The adjacency-criteria conjecture for minimum CADs
Adjacency-criteria conjecture. The adjacency relations between cells will play a central role in formulating concrete and computationally feasible criteria for deciding when a tree…
- 0 votes0 replies0 views
Removal of the codimension hypothesis in the variation of the main lemma
Let and be real polynomials in of positive degrees in , let be their resultant with respect to , and suppose…
- 0 votes0 replies0 views
Generalization of geometric delineability without the relative-dimension-one condition
Let be the real closed field under consideration, let and be affine -varieties, and let be a morphism such that is a free…
- 0 votes0 replies0 views
Non-typicality and non-sharpness of the CAD worst-case bound for the PSD solver
Consider the general polynomial sign determination problem with interaction type , outside the two special cases treated earlier, and the algorithm whose…
- 0 votes0 replies1 view
Lazard's regular cell complex conjecture for strong cylindrical algebraic decompositions
Let be a strong cylindrical algebraic decomposition of adapted to a closed and bounded semi-algebraic set . Lazard's conjecture. The decomposition ind…