Pages that link to "Item:Q1207337"
From MaRDI portal
The following pages link to Counting connected components of a semialgebraic set in subexponential time (Q1207337):
Displayed 14 items.
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021) (← links)
- 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)
- Testing elementary function identities using CAD (Q944998) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
- Hybrid automata, reachability, and systems biology (Q969180) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- Inclusion dynamics hybrid automata (Q999262) (← links)
- Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials (Q1024388) (← links)
- Description of the connected components of a semialgebraic set in single exponential time (Q1317872) (← links)
- Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
- Computing the first few Betti numbers of semi-algebraic sets in single exponential time (Q2457390) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Computing roadmaps of semi-algebraic sets on a variety (Q4700178) (← links)