Complexity of deciding connectivity in real algebraic sets
From MaRDI portal
Publication:5244507
Recommendations
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- scientific article; zbMATH DE number 1262423
- On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
- Algorithm for Connectivity Queries on Real Algebraic Curves
- Bounding the number of connected components of a real algebraic set
- On the \(d\)-dimensional algebraic connectivity of graphs
- scientific article; zbMATH DE number 21309
- Determination of the connected components of a semialgebraic set in subexponential time
- Computing tight upper bounds on the algebraic connectivity of certain graphs
- Semi-algebraic decision complexity, the real spectrum, and degree
Cited in
(7)- scientific article; zbMATH DE number 2187719 (Why is no real title available?)
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
- scientific article; zbMATH DE number 27176 (Why is no real title available?)
- Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
- scientific article; zbMATH DE number 1262423 (Why is no real title available?)
This page was built for publication: Complexity of deciding connectivity in real algebraic sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244507)