Publisher
Springer Berlin Heidelberg
Reference95 articles.
1. Ada, A., Chattopadhyay, A., Cook, S.A., Fontes, L., Koucký, M., Pitassi, T.: The hardness of being private. In: IEEE Conference on Computational Complexity, pp. 192–202 (2012)
2. Agarwal, M., Kayal, N., Saxena, N.: Primes is in p. Annals of Mathematics 160(r21), 781–793 (2004)
3. Ajtai, M.: A non-linear time lower bound for boolean branching programs. Theory of Computing 1(1), 149–176 (2005)
4. Alekhnovich, M., Borodin, A., Buresh-Oppenheim, J., Impagliazzo, R., Magen, A.: Toward a model for backtracking and dynamic programming. Electronic Colloquium on Computational Complexity (ECCC) 16, 38 (2009)
5. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137–147 (1999)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献