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

Lukasz Kowalik et al. (2023)

Details and statistics

DOI: 10.48550/ARXIV.2307.00406

access: open

type: Informal or Other Publication

metadata version: 2023-08-31

a service of  Schloss Dagstuhl - Leibniz Center for Informatics