The following pages link to (Q5804648):
Displaying 5 items.
- Algebraic decision trees and Euler characteristics (Q673780) (← links)
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← 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)
