Author:
Healy Alexander,Viola Emanuele
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Agrawal, M., Allender, E., Impagliazzo, R., Pitassi, T., Rudich, S.: Reducing the complexity of reductions. Comput. Complexity 10(2), 117–138 (2001)
2. Allender, E., Bernasconi, A., Damm, C., von zur Gathen, J., Saks, M., Shparlinski, I.: Complexity of some arithmetic problems for binary polynomials. Comput. Complexity 12(1-2), 23–47 (2003)
3. Allender, E., Hellerstein, L., McCabe, P., Pitassi, T., Saks, M.: Minimizing DNF Formulas and AC0 Circuits Given a Truth Table. Electronic Colloquium on Computational Complexity, TR05-126 (2005), http://www.eccc.uni-trier.de/eccc
4. Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within NC 1. J. Comput. System Sci. 41(3), 274–306 (1990)
5. Boyar, J., Frandsen, G., Sturtivant, C.: An arithmetic model of computation equivalent to threshold circuits. Theoret. Comput. Sci. 93(2), 303–319 (1992)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献