"Inapproximability of Combinatorial Problems via Small LPs and SDPs."

Gábor Braun, Sebastian Pokutta, Daniel Zink (2015)

> Home

Details and statistics

DOI: 10.1145/2746539.2746550

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/BraunPZ15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/BraunPZ15
Gábor Braun, Sebastian Pokutta, Daniel Zink:
Inapproximability of Combinatorial Problems via Small LPs and SDPs. STOC 2015: 107-116

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.