The following pages link to (Q4230349):
Displayed 9 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)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
- Decision trees: Old and new results. (Q1854291) (← links)
- Lower bounds for arithmetic networks. II: Sum of Betti numbers (Q1908901) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- A computationally intractable problem on simplicial complexes (Q1917045) (← links)
- Time and space complexity of deterministic and nondeterministic decision trees (Q2679423) (← links)