1. Lecture Notes in Computer Science;M Aldaz,1998
2. Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proc. of the 15th Annual ACM Symp. on Theor. Comput., pp. 80–86. ACM, New York (1983)
3. Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Learnability and the Vapnik-Chervonenkis dimension. J. ACM 36, 929–965 (1989)
4. Gabrielov, A.N., Vorobjov, N.: Complexity of computations with Pfaffian and Noetherian functions. In: Normal Forms, Bifurcations and Finiteness Problems in Differential Equations. Kluwer, Dordrecht (2004)
5. Gabrielov, A., Vorobjov, N., Zell, T.: Betti numbers of semialgebraic and sub-Pfaffian sets. J. Lond. Math. Soc. 69, 27–43 (2003)