On the computational complexities of Quantified Integer Programming variants

In this paper, we study Quantified Integer Programming (QIP) and Quantified Integer Implication (QII) from the perspective of computational complexity. In particular, we show that the restricted language of QIIs is expressive enough to fully capture Presburger Arithmetic. Secondly, we establish the computational complexity of QIP over polytopes, i.e., cases where an upper and lower bound can always be derived for existential variables. Thirdly, we investigate the complexities of partially bounded and unbounded variants of QIPs and QIIs. Finally, we examine the connections between QIPs and QIIs with limited quantifier alternations and the polynomial hierarchy.

[1]  Thomas Sturm,et al.  A New Approach for Automatic Theorem Proving in Real Geometry , 1998, Journal of Automated Reasoning.

[2]  S. Thomas McCormick,et al.  Fast algorithms for parametric scheduling come from extensions to parametric maximum flow , 1996, STOC '96.

[3]  Thi-Bich-Hanh Dao,et al.  Expressiveness of Full First-Order Constraints in the Algebra of Finite or Infinite Trees , 2000, Constraints.

[4]  George E. Collins,et al.  Partial Cylindrical Algebraic Decomposition for Quantifier Elimination , 1991, J. Symb. Comput..

[5]  M. Fischer,et al.  SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC , 1974 .

[6]  Paolo Serafini,et al.  Scheduling Jobs on Several Machines with the Job Splitting Property , 1996, Oper. Res..

[7]  Marco Spuri,et al.  Deadline Scheduling for Real-Time Systems , 2011 .

[8]  Thomas Sturm,et al.  REDLOG: computer algebra meets computer logic , 1997, SIGS.

[9]  K. Subramani,et al.  Tractable Fragments of Presburger Arithmetic , 2005, Theory of Computing Systems.

[10]  K. Subramani,et al.  Polynomial time certifying algorithms for the planar quantified integer programming problem , 2013, J. Log. Comput..

[11]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[12]  K. Subramani,et al.  On a decision procedure for quantified linear programs , 2007, Annals of Mathematics and Artificial Intelligence.

[13]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[14]  Michael J. Maher,et al.  On Fourier's algorithm for linear arithmetic constraints , 1992, Journal of Automated Reasoning.

[15]  Leonard Berman,et al.  The Complexity of Logical Theories , 1980, Theor. Comput. Sci..

[16]  K. Subramani,et al.  A complexity perspective on entailment of parameterized linear constraints , 2012, Constraints.

[17]  K. Subramani,et al.  An Analysis of Partially Clairvoyant Scheduling , 2003, J. Math. Model. Algorithms.

[18]  Richard Gerber,et al.  Parametric Dispatching of Hard Real-Time Tasks , 1995, IEEE Trans. Computers.

[19]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[20]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[21]  William J. Cook,et al.  Sensitivity theorems in integer linear programming , 1986, Math. Program..

[22]  K. Subramani,et al.  On the complexity of quantified linear systems , 2014, Theor. Comput. Sci..

[23]  Jeanne Ferrante,et al.  A Decision Procedure for the First Order Theory of Real Addition with Order , 1975, SIAM J. Comput..

[24]  K. Subramani,et al.  Analyzing restricted fragments of the theory of linear arithmetic , 2016, Annals of Mathematics and Artificial Intelligence.

[25]  Satoru Iwata,et al.  A fast bipartite network flow algorithm for selective assembly , 1998, Oper. Res. Lett..

[26]  Frédéric Goualard,et al.  Universally Quantified Interval Constraints , 2000, CP.

[27]  Christopher W. Brown.  QEPCAD B: a program for computing with semi-algebraic sets using CADs , 2003, SIGS.

[28]  Zohar Manna,et al.  The calculus of computation - decision procedures with applications to verification , 2007 .

[29]  Stefan Ratschan,et al.  Efficient solving of quantified inequality constraints over the real numbers , 2002, TOCL.

[30]  B. Donald,et al.  Quantifier Elimination for Conjunctions of Linear Constraints via a Convex Hull Algorithm , 2013 .

[31]  Volker Weispfenning,et al.  The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.