Author:
Beygelzimer Alina,Ogihara Mitsunori
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Amir, A., Beigel, R., Gasarch, W.: Some connections between bounded query classes and nonuniform complexity. In: The 5th Structure in Complexity Theory Conference, pp. 232–243 (1990)
2. Ar, S., Lipton, R., Rubinfeld, R., Sudan, M.: Reconstructing algebraic functions from mixed data. SIAM Journal on Computing 28(2), 487–510 (1998)
3. Beals, R., Chang, R., Gasarch, W., Torán, J.: On finding the number of graph automorphisms. Chicago Journal of Theoretical Computer Science 1999(1)
4. Beigel, R., Kummer, M., Stephan, F.: Approximable sets. Information and Computation 120(2), 304–314 (1995)
5. Beygelzimer, A., Ogihara, L.: The (non)enumerability of the determinant and the rank. Theory of Computing Systems 36(4), 359–374