Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The computational complexity of integer programming with alternations - MaRDI portal

The computational complexity of integer programming with alternations

From MaRDI portal

Publication:5111136

Jump to:navigation, search

DOI10.4230/LIPIcs.CCC.2017.6zbMath1440.90028arXiv1702.08662MaRDI QIDQ5111136

Danny Nguyen, Igor Pak

Publication date: 26 May 2020

Full work available at URL: https://arxiv.org/abs/1702.08662

zbMATH Keywords

integer programming alternations projection of integer points

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Short Presburger Arithmetic Is Hard ⋮ On the number of integer points in translated and expanded polyhedra ⋮ COMPLEXITY OF SHORT GENERATING FUNCTIONS

This page was built for publication: The computational complexity of integer programming with alternations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5111136&oldid=19628458"