TY - CHAP A1 - Braun, Gábor A1 - Pokutta, Sebastian T1 - Rank of random half-integral polytopes T2 - Electronic Notes in Discrete Mathematics Y1 - 2010 UR - http://www.box.net/shared/0zx04174bg N1 - Additional Note: doi:10.1016/j.endm.2010.05.053 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.endm.2010.05.053 VL - 36 SP - 415 EP - 422 ER - TY - CHAP A1 - Braun, Gábor A1 - Pokutta, Sebastian T1 - The matching polytope does not admit fully-polynomial size relaxation schemes T2 - Proceeedings of SODA Y1 - 2015 ER - TY - CHAP A1 - Braun, Gábor A1 - Pokutta, Sebastian A1 - Zink, Daniel T1 - Inapproximability of combinatorial problems via small LPs and SDPs T2 - Proceeedings of STOC Y1 - 2015 ER - TY - CHAP A1 - Braun, Gábor A1 - Roy, Aurko A1 - Pokutta, Sebastian T1 - Stronger Reductions for Extended Formulations T2 - Proceedings of IPCO Y1 - 2016 ER - TY - CHAP A1 - Braun, Gábor A1 - Brown-Cohen, Jonah A1 - Huq, Arefin A1 - Pokutta, Sebastian A1 - Raghavendra, Prasad A1 - Weitz, Benjamin A1 - Zink, Daniel T1 - The matching problem has no small symmetric SDP T2 - Proceddings of SODA 2016 Y1 - 2016 N1 - URL of the PDF: http://ieeexplore.ieee.org/abstract/document/7447134/ ER - TY - JOUR A1 - Braun, Gábor A1 - Guzmán, Cristóbal A1 - Pokutta, Sebastian T1 - Corrections to “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory” JF - IEEE Transactions on Information Theory N2 - This note closes a gap in the proof of Theorem VI.3 from the article “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory” (2017). Y1 - 2024 U6 - https://doi.org/10.1109/TIT.2024.3357200 VL - 70 IS - 7 SP - 5408 EP - 5409 ER -