Polynomial time certifying algorithms for the planar quantified integer programming problem

DOI10.1093/LOGCOM/EXS034MaRDI QIDQ2863168zbMATH OpenOpenAlexFDO

Authors Zhiyao Liang, K. Subramani, J. Worthington

Publication date 21 November 2013

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exs034

zbMATH Keywords

certifying algorithmsconstraintslattice pointspolynomial timequantified integer programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• On the complexity of quantified integer programming
• Automated Reasoning
• Integer quadratic programming in the plane
• A linear algorithm for integer programming in the plane
• Polyhedral and algorithmic properties of quantified linear programs

This page was built for publication: Polynomial time certifying algorithms for the planar quantified integer programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2863168)