Computing the EHZ capacity is \(\operatorname{NP}\)-hard
From MaRDI portal
Publication:6652100
DOI10.1090/bproc/250MaRDI QIDQ6652100
Frank Vallentin, Karla Leipold
Publication date: 12 December 2024
Published in: Proceedings of the American Mathematical Society. Series B (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Feedback arc set in bipartite tournaments is NP-complete
- Symplectic topology and Hamiltonian dynamics
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs
- On the symplectic size of convex polytopes
- Lectures on Polytopes
This page was built for publication: Computing the EHZ capacity is \(\operatorname{NP}\)-hard
