1. Althfer, I.: On sparse approximations to randomized strategies and convex combinations. Linear Algebra and its Applications 199(Suppl. 1), 339–355 (1994); Special Issue Honoring Ingram Olkin
2. Amir, A., Beigel, R., Gasarch, W.I.: Some connections between bounded query classes and non-uniform complexity. ECCC 7(024) (2000)
3. Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. In: Proc. of the 31st IEEE Symp. on Foundations of Computer Science, pp. 16–25 (1990)
4. Balcázar, J., Book, R.V., Schöning, U.: Sparse sets lowness and highness. SIAM J. Comput. 15, 739–747 (1986)
5. Balcázar, J.L., Book, R.V., Schöning, U.: The polynomial-time hierarchy and sparse oracles. J. ACM 33, 603–617 (1986)