Author:
Amireddy Prashanth,Jayasurya Sai,Sarma Jayalal
Publisher
Springer International Publishing
Reference19 articles.
1. Ben-Asher, Y., Newman, I.: Decision trees with and or queries. In Proceedings of 10th Annual Conference on Structure in Complexity Theory, pp. 74–81 (1995)
2. Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proceedings of the 15th ACM Symposium on Theory of Computing, pp. 80–86 (1983)
3. Björner, A., Lovász, L., Yao, A.C.C.: Linear decision trees: volume estimates and topological bounds. In Proceedings of the 24th ACM Symposium on Theory of Computing, pp. 170–177 (1992)
4. Blais, E., Canonne, C.L., Oliveira, I.C., Servedio, R.A., Tan, L.-Y.: Learning circuits with few negations. Approx. Random. Comb. Opti. 40, 512–527 (2015)
5. Blum, A.: Rank-r decision trees are a subclass of r-decision lists. Inf. Process. Lett. 42(4), 183–185 (1992)