1. Universal classes of hash functions;Carter;Comput. System Sc. J.,1979
2. The complexity of theorem proving procedures;Cook,1971
3. A Completeness Theorem for Almost Everywhere Invulnerable Generators;Feigenbaum,1989
4. Computers and Intractability: A guide to the Theory of NP-completeness;Garey,1979
5. Towards a Theory of Average Case Complexity (A Survey);Goldreich,1988