Pages that link to "Item:Q1207337"

The following pages link to Counting connected components of a semialgebraic set in subexponential time (Q1207337):

Displaying 25 items.

• Divide and conquer roadmap for algebraic sets (Q464736) (← links)
• A baby step-giant step roadmap algorithm for general algebraic sets (Q486687) (← links)
• 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)
• Numerically computing real points on algebraic sets (Q1956231) (← links)
• Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
• Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
• Computing real witness points of positive dimensional polynomial systems (Q2357373) (← 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)
• Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets (Q4635358) (← links)
• Computing roadmaps of semi-algebraic sets on a variety (Q4700178) (← links)
• Hybrid Automata in Systems Biology: How Far Can We Go? (Q5404076) (← links)
• Persistent Homology of Semialgebraic Sets (Q6087751) (← links)
• Efficient simplicial replacement of semialgebraic sets (Q6103446) (← links)
• Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results (Q6170822) (← links)
• Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set (Q6624170) (← links)