1. Beigi S, Taghavi L (2019) Span program for non-binary functions. Quantum Information and Computation(QIC) 19(9&10):0760–0792
2. Beigi S, Taghavi L (2020) Quantum speedup based on classical decision trees. Quantum 4:241
3. Childs A.M., Kothari R, Ozols M, Roetteler M (2013) Easy and hard functions for the boolean hidden shift problem. In: Leibniz International proceedings in informatics, LIPIcs, vol 22, pp 50–79
4. Hegedüs T (1995) Generalized teaching dimensions and the query complexity of learning. In: Proceedings of the eighth annual conference on Computational learning theory, pp 108–117
5. Kothari R (2014a) An optimal quantum algorithm for the oracle identification problem. In: Leibniz International proceedings in informatics, LIPIcs, vol 25, pp 482–493