scientific article; zbMATH DE number 8550

MaRDI QIDQ3971133zbMATH OpenFDO

Authors Joos Heintz, Pablo Solernó, Dima Grigoriev, Marie-Françoise Roy, Nicolai Vorobjov

Publication date 25 June 1992

zbMATH Keywords

single exponential complexity of the counting of the connected components of a semi-algebraic set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects in algebraic geometry (14Q99) Semialgebraic sets and related spaces (14P10)

Recommendations

• scientific article; zbMATH DE number 27176
• Description of the connected components of a semialgebraic set in single exponential time
• scientific article; zbMATH DE number 1262423
• scientific article; zbMATH DE number 21309

Cited in

(8)

• Counterexamples to quantifier elimination for fewnomial and exponential expressions
• scientific article; zbMATH DE number 21309 (Why is no real title available?)
• scientific article; zbMATH DE number 17835 (Why is no real title available?)
• Finding connected components of a semialgebraic set in subexponential time
• Divide and conquer roadmap for algebraic sets
• A baby step-giant step roadmap algorithm for general algebraic sets
• Determination of the connected components of a semialgebraic set in subexponential time
• Description of the connected components of a semialgebraic set in single exponential time

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 Q3971133)