1. Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, New York (2008)
2. Beasley, L.B., Klauck, H., Lee, T., Theis, D.O.: Communication complexity, linear optimization, and lower bounds for the nonnegative rank of matrices (dagstuhl seminar 13082). Dagstuhl Rep. 3(2), 127–143 (2013)
3. Cambridge Studies in Advanced Mathematics;B Bollobás,2001
4. Braun, G., Fiorini, S., Pokutta, S.: Average case polyhedral complexity of the maximum stable set problem. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, Barcelona, Spain, 4–6 September 2014, pp. 515–530 (2014). http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.515
5. Lecture Notes in Computer Science;V Dani,2011