No. Title Author Year
1 Limitations of Convex Programming: Lower Bounds on Extended Formulations and Factorization Ranks (Dagstuhl Seminar 15082) Klauck, Hartmut et al. 2015
2 Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082) Beasley, LeRoy B. et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 2


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI