"On the Extension Complexity of Polytopes Separating Subsets of the Boolean ..."

Pavel Hrubes, Navid Talebanfard (2023)

> Home

Details and statistics

DOI: 10.1007/S00454-022-00419-3

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dcg/HrubesT23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcg/HrubesT23
Pavel Hrubes, Navid Talebanfard:
On the Extension Complexity of Polytopes Separating Subsets of the Boolean Cube. Discret. Comput. Geom. 70(1): 268-278 (2023)

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.