Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference11 articles.
1. O. Goldreich. Computational Complexity: A Conceptual Perspective. Cambridge University Press, 2008.
2. O. Goldreich. Three XOR-Lemmas: An Exposition. In Studies in Complexity and Cryptography, Lecture Notes in Computer Science (Vol. 6650), Springer, 2011. Preliminary version in ECCC, TR95-056, 1995.
3. O. Goldreich and A. Tal. Matrix rigidity of random Toeplitz matrices. Computational Complexity, Vol. 27 (2), pages 305–350, 2018. Preliminary versions in 48th STOC (2016) and ECCC TR15-079 (2015).
4. O. Goldreich and A. Wigderson. On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions. In Computational Complexity and Property Testing, Lecture Notes in Computer Science (Vol. 12050), Springer, 2020. Preliminary version in ECCC, TR13-043, 2013.
5. S. Jukna. Boolean Function Complexity: Advances and Frontiers. Algorithms and Combinatorics, Vol. 27, Springer, 2012.