1. Reducibility, randomness, and intractability;Adleman;Proc. 9th Ann. ACM Symp. on Theory of Computing,1977
2. The complexity of sparse sets in P;Allender,1986
3. Some problems involving Razborov–Smolensky polynomials;Barrington;TR 90-59 UMass COINS,1990
4. Relativized counting classes: relations among thresholds, parity, and mods;Beigel;J. Comput. System Sci.,1991
5. Representing Boolean functions as polynomials modulo composite integers;Barrington;Proc. 24th Ann. ACM Symp. on Theory of Computing,1992