Pages that link to "Item:Q1317872"
From MaRDI portal
The following pages link to Description of the connected components of a semialgebraic set in single exponential time (Q1317872):
Displaying 12 items.
- Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time (Q937274) (← links)
- Computing the first Betti number of a semi-algebraic set (Q937278) (← links)
- Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials (Q1024388) (← links)
- Reachability and connectivity queries in constraint databases (Q1394800) (← links)
- Numerically computing real points on algebraic sets (Q1956231) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets (Q2576661) (← links)
- Exact algorithms for linear matrix inequalities (Q2834563) (← links)
- Counting connected components of a semi-algebraic set in single exponential time (Q3971133) (← links)
- (Q3980333) (← links)
- (Q4232468) (← links)
- Finding connected components of a semialgebraic set in subexponential time (Q5966655) (← links)
