A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00454-009-9239-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2592887901 / rank | |||
Normal rank |
Revision as of 02:05, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface |
scientific article |
Statements
A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (English)
0 references
10 March 2011
0 references
A probabilitstic algorithm of complexity \((nD)^{O(n^{1.5})}\) for the problem of computing a roadmap of a closed and bounded hypersurface \(V\) of degree \(D\) in \(n\) variables with finitely many singular points is given. The concept of a roadmap is slightly modified considering algebraic sets \(V\subseteq \mathbb{C}^n\). An algebraic set \(\mathfrak{R}\subseteq V\) is a roadmap if each semi--algebraic component of \(V\cap \mathbb{R}^n\) has a nonempty and semi--algebraically connected intersection with \(\mathfrak {R}\cap \mathbb{R}^n\).
0 references
computational real algebraic geometry
0 references
algorithms
0 references
roadmaps
0 references
complexity
0 references