A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets

From MaRDI portal

(Redirected from A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_Nearly_Optimal_Algorithm_for_Deciding_Connectivity_Queries_in_Smooth_and_Bounded_Real_Algebraic_Sets&oldid=80088851"