Opening book details…
Can I read The presence of a zero in an integer linear recurrent sequence is NP-hard to decide on EtoBox?
The presence of a zero in an integer linear recurrent sequence is NP-hard to decide by Vincent D. Blondel; Natacha Portier is a Mathematics article available to read on EtoBox.
What is The presence of a zero in an integer linear recurrent sequence is NP-hard to decide about?
We show that the problem of determining if a given integer linear recurrent sequence has a zero-a problem that is known as "Pisot's problem"-is NP-hard. With a similar argument we show that the problem of finding the minimal realization dimension of a one-letter max-plus rational series is NP-hard. This last result answers a folklore question raised in the control literature on the max-plus approach to discrete event systems. Our results are simple consequences of a construction due to Stockmeyer and Meyer.
Who reads The presence of a zero in an integer linear recurrent sequence is NP-hard to decide?
It is typically read by researchers, students, and practitioners in Mathematics.
- Author
- Vincent D. Blondel; Natacha Portier
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0024-3795)
- Published
- 2002
- Language
- EN
- Field
- Mathematics (Physical Sciences)