Pages that link to "Item:Q2817657"
From MaRDI portal
The following pages link to Lower bounds on testing membership to a polyhedron by algebraic decision trees (Q2817657):
Displaying 5 items.
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021) (← links)
- Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- A computationally intractable problem on simplicial complexes (Q1917045) (← links)
- Decision tree complexity and Betti numbers (Q5906824) (← links)
