Complexity of Restricted Variants of Skolem and Related Problems

Given a linear recurrence sequence (LRS), the Skolem problem, asks whether it ever becomes zero. The decidability of this problem has been open for several decades. Currently decidability is known only for LRS of order upto 4. For arbitrary orders (i.e., number of terms the n-th depends on), the only known complexity result is NP-hardness by a result of Blondel and Portier from 2002. In this paper, we give a different proof of this hardness result, which is arguably simpler and pinpoints the source of hardness. To demonstrate this, we identify a subclass of LRS for which the Skolem problem is in fact NP-complete. We show the generic nature of our lower-bound technique by adapting it to show stronger lower bounds of a related problem that encompasses many known decision problems on linear recurrent sequences.

[1]  Joël Ouaknine,et al.  On the Positivity Problem for Simple Linear Recurrence Sequences, , 2013, ICALP.

[2]  Dan Kalman,et al.  The Generalized Vandermonde Matrix , 1984 .

[3]  Mark Braverman,et al.  Termination of Integer Linear Programs , 2006, CAV.

[4]  Joël Ouaknine,et al.  On linear recurrence sequences and loop termination , 2015, SIGL.

[5]  Joël Ouaknine,et al.  On the Complexity of the Orbit Problem , 2013, J. ACM.

[6]  Ashish Tiwari,et al.  Termination of Linear Programs , 2004, CAV.

[7]  Blaise Genest,et al.  On Regularity of Unary Probabilistic Automata , 2016, STACS.

[8]  Igor E. Shparlinski,et al.  Recurrence Sequences , 2003, Mathematical surveys and monographs.

[9]  Joel Ouaknine,et al.  On Termination of Integer Linear Loops , 2015, SODA.

[10]  M. Schaefer,et al.  Completeness in the Polynomial-Time Hierarchy A Compendium ∗ , 2008 .

[11]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[12]  Joël Ouaknine,et al.  Decision Problems for Linear Recurrence Sequences , 2012, RP.

[13]  V. Blondel,et al.  The presence of a zero in an integer linear recurrent sequence is NP-hard to decide , 2002 .

[14]  Joël Ouaknine,et al.  The Polyhedron-Hitting Problem , 2014, SODA.

[15]  Samir Genaim,et al.  On the Termination of Integer Loops , 2012, TOPL.

[16]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[17]  Joël Ouaknine,et al.  Positivity Problems for Low-Order Linear Recurrence Sequences , 2013, SODA.

[18]  Joël Ouaknine,et al.  Reachability problems for Markov chains , 2015, Inf. Process. Lett..

[19]  Prasoon Tiwari,et al.  A problem that is easier to solve on the unit-cost algebraic RAM , 1992, J. Complex..

[20]  Joël Ouaknine,et al.  Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences , 2013, ICALP.

[21]  Godfrey H. Hardy,et al.  An introduction to the theory of numbers (5. ed.) , 1995 .

[22]  Between Decidability.  Skolem's Problem - On the Border , 2005 .