Pages that link to "Item:Q1854291"
From MaRDI portal
The following pages link to Decision trees: Old and new results. (Q1854291):
Displaying 13 items.
- On decision trees for orthants (Q287088) (← links)
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021) (← links)
- Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs (Q685715) (← links)
- An exponential lower bound on the size of algebraic decision trees for MAX (Q1277095) (← links)
- A note on Rabin's width of a complete proof (Q1327592) (← links)
- Equivalence of binary and ternary algebraic decision trees (Q1364419) (← links)
- Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- Lower bounds on testing membership to a polyhedron by algebraic decision trees (Q2817657) (← links)
- Decision trees of algorithms and a semivaluation to measure their distance (Q2863890) (← links)
- Linear Decision Trees, Subspace Arrangements, and Mobius Functions (Q4305906) (← links)
- Data Mining with Decision Trees (Q5175869) (← links)
- (Q5458729) (← links)
