Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wulf, Lasse
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity Computational Geometry 52-08, 52B05, 68Q25 F.2.2; F.1.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2502.16398