1. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, pp. 493–500, ACM-SIAM (1997)
2. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1(1), 55–66 (1998)
3. Barak, B., Chan, S.O., Kothari, P.K.: Sum of squares lower bounds from pair wise independence. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2015, pp. 97–106. ACM (2015)
4. Barak, B., Hopkins, S.B., Kelner, J., Kothari, P., Moitra, A., Potechin, A.: A nearly tight sum-of-squares lower bound for the planted clique problem. In: Proceedings of Foundations of Computer Science, FOCS 2016, pp. 428–437. IEEE (2016)
5. Barak, B., Moitra, A.: Noisy tensor completion via the sum-of-squares hierarchy. In: Proceedings of the 29th Conference on Learning Theory, COLT 2016, pp. 417–445 (2016)