"Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard."

Lukasz Kowalik et al. (2024)

> Home

Details and statistics

DOI: 10.1137/1.9781611977936.25

access: closed

type: Conference or Workshop Paper

metadata version: 2024-04-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sosa/KowalikLMPS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sosa/KowalikLMPS24
Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. SOSA 2024: 279-285

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.