Computing the EHZ capacity is NP-hard
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912144148135936 |
|---|---|
| author | Leipold, Karla Vallentin, Frank |
| author_facet | Leipold, Karla Vallentin, Frank |
| contents | The Ekeland-Hofer-Zehnder capacity (EHZ capacity) is a fundamental symplectic invariant of convex bodies. We show that computing the EHZ capacity of polytopes is NP-hard. For this we reduce the feedback arc set problem in bipartite tournaments to computing the EHZ capacity of simplices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_09914 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Computing the EHZ capacity is NP-hard Leipold, Karla Vallentin, Frank Symplectic Geometry Computational Complexity Combinatorics The Ekeland-Hofer-Zehnder capacity (EHZ capacity) is a fundamental symplectic invariant of convex bodies. We show that computing the EHZ capacity of polytopes is NP-hard. For this we reduce the feedback arc set problem in bipartite tournaments to computing the EHZ capacity of simplices. |
| title | Computing the EHZ capacity is NP-hard |
| topic | Symplectic Geometry Computational Complexity Combinatorics |
| url | https://arxiv.org/abs/2402.09914 |