Selected papers that cite this one
- Manindra Agrawal, Eric Allender, and Steven Rudich. Reductions in circuit complexity: An isomorphism theorem and a gap theorem. Journal of Computer and System Sciences, 57(2):127-143, October 1998.
- John Gill and Manuel Blum. On almost everywhere complex recursive functions. Journal of the ACM, 21(3):425-435, July 1974.
Selected references
- A. Borodin. Computational complexity and the existence of complexity gaps. Journal of the ACM, 19(1):158-174, January 1972.