Pages that link to "Item:Q1908901"
From MaRDI portal
The following pages link to Lower bounds for arithmetic networks. II: Sum of Betti numbers (Q1908901):
Displaying 9 items.
- Bounding the equivariant Betti numbers of symmetric semi-algebraic sets (Q340423) (← links)
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021) (← links)
- Topological complexity of the relative closure of a semi-Pfaffian couple (Q958241) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Nearly sharp complexity bounds for multiprocessor algebraic computations (Q1361876) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- A complexity theory of constructible functions and sheaves (Q2340508) (← links)
- Topological lower bounds for arithmetic networks (Q2410689) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
