Gabor Braun, Sebastian Pokutta, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013, 688
Martin Sauerhoff, “Approximation of boolean functions by combinatorial rectangles”, Theoretical Computer Science, 301, № 1-3, 2003, 45
Rahul Jain, 2021 IEEE International Symposium on Information Theory (ISIT), 2021, 262
Alexander A. Sherstov, 8634, Mathematical Foundations of Computer Science 2014, 2014, 24
Oded Goldreich, 3895, Theoretical Computer Science, 2006, 254
David Avis, Hans Raj Tiwary, “On the extension complexity of combinatorial polytopes”, Math. Program., 153, № 1, 2015, 95
Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf, Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012, 95
Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer, “Distributed Verification and Hardness of Distributed Approximation”, SIAM J. Comput., 41, № 5, 2012, 1235
François Le Gall, “Exponential Separation of Quantum and Classical Online Space Complexity”, Theory Comput Syst, 45, № 2, 2009, 188
Gábor Braun, Rahul Jain, Troy Lee, Sebastian Pokutta, “Information-theoretic approximations of the nonnegative rank”, comput. complex., 26, № 1, 2017, 147