z-logo
open-access-imgOpen Access
The matching problem has no small symmetric SDP
Author(s) -
Gábor Braun,
Jonah Brown-Cohen,
Arefin Huq,
Sebastian Pokutta,
Prasad Raghavendra,
Aurko Roy,
Benjamin Weitz,
Daniel Zink
Publication year - 2015
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1137/1.9781611974331.ch75
Subject(s) - mathematics , combinatorics , semidefinite programming , matching (statistics) , linear programming , upper and lower bounds , relaxation (psychology) , discrete mathematics , linear programming relaxation , algorithm , mathematical optimization , statistics , mathematical analysis , psychology , social psychology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom