The presence of a zero in an integer linear recurrent sequence is NP-hard to decide

By Vincent D. Blondel, N. Portier. 2002

73 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/013f9794497964bf119f4835bfb11ecfa3e691d1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Vincent D. Blondel
2. John N. Tsitsiklis
3. Ali Jadbabaie
4. Pablo A. Parrilo
5. Boris Polyak
6. Pavel S. Shcherbakov

Citations in the corpus

• A survey of computational complexity results in systems and control (2000, background): “The problem is proved NP-hard in Blondel and Portier (1999a) but it is unknown whether it is decidable.”
• Distributed control of positive systems (2011, unknown): “See [3] for the discrete time problem and [1] for continuous time.”