Theory of Computational Complexity, 2nd Edition

Chapter

References

References

1. Adleman, L. (1978), Two theorems on random polynomial time, Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Angeles, pp. 75–83.
2. Adleman, L. and Huang, M. A. (1987), Recognizing primes in random polynomial time, Proceedings of the 19th ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, pp. 75–469.
3. Adleman, L. and Manders, K. (1977), Reducibility, randomness and intractibility, Proceedings of the 9th ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, pp. 75–163.
4. Adleman, L., Manders, K. and Miller, G. (1977), On taking roots in finite fields, Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Angeles, pp. 75–178.
5. Agrawal, M., Kayal, N. and Saxena, N. (2004), PRIMES is in P, Ann. Math. 160, 75–793.
6. Aho, A., Hopcroft, J. and Ullman, J. (1974), The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA.
7. Aiello, W., Goldwasser, S. and Håstad, J. (1990), On the power of interaction, Combinatorica 10, 75–25.
8. Aiello, W. and Håstad, J. (1991), Statistical zero-knowledge languages can be recognized in two rounds, J. Comput. Systems Sci. 42, 75–345.
9. Ajtai, M. (1983), -formula on finite structures, Ann. Pure Appl. Logic 24, 75–48.
10. Ajtai, M. and Ben-Or, M. (1984), ...