Akinori KAWACHI, “Proving Circuit Lower Bounds in High Uniform Classes”, IIS, 20:1 (2014), 1
Ryan Williams, 2014 IEEE 29th Conference on Computational Complexity (CCC), 2014, 248
Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman, 2014 IEEE 29th Conference on Computational Complexity (CCC), 2014, 262
Ryan Williams, Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, 664
Kei UCHIZAWA, “Lower Bounds for Threshold Circuits of Bounded Energy”, IIS, 20:1 (2014), 27
Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard, Lecture Notes in Computer Science, 8635, Mathematical Foundations of Computer Science 2014, 2014, 336
Albert Atserias, Anuj Dawar, “Degree lower bounds of tower-type for approximating formulas with parity quantifiers”, ACM Trans. Comput. Logic, 15:1 (2014), 1
Ruiwen Chen, Valentine Kabanets, Jeff Kinne, “Lower Bounds Against Weakly-Uniform Threshold Circuits”, Algorithmica, 70:1 (2014), 47
Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien, “Learning Read-Constant Polynomials of Constant Degree Modulo Composites”, Theory Comput Syst, 55:2 (2014), 404
Benjamin Rossman, Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, 203