Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Field |
|---|---|---|
2017 | MFCS | Discrete mathematics,Combinatorics,Decision problem,Computer science,Decidability,Skolem problem |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Akshay | 1 | 61 | 12.47 |
| Nikhil Balaji | 2 | 9 | 4.24 |
| Nikhil Vyas | 3 | 3 | 4.79 |