Author:
Pourmoradnasseri Mozhgan,Theis Dirk Oliver
Publisher
Springer International Publishing
Reference15 articles.
1. 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)
2. Bollobás, B.: Random Graphs. Cambridge Studies in Advanced Mathematics, 2nd edn., vol. 73. Cambridge University Press, Cambridge (2001)
3. Dietzfelbinger, M., Hromkovič, J., Schnitger, G.: A comparison of two lower-bound methods for communication complexity. Theoret. Comput. Sci. 168(1), 39–51 (1996). 19th International Symposium on Mathematical Foundations of Computer Science (Košice, 1994)
4. Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.O.: Combinatorial bounds on nonnegative rank and extended formulations. Discrete Math. 313(1), 67–83 (2013)
5. Friesen, M., Hamed, A., Lee, T., Theis, D.O.: Fooling-sets and rank. Eur. J. Comb. 48, 143–153 (2015)