The presence of a zero in an integer linear recurrent sequence is NP-hard to decide (Q1611897): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q162832 |
Changed an Item |
||
| Property / author | |||
| Property / author: Blondel, Vincent D. / rank | |||
Normal rank | |||
Revision as of 00:25, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The presence of a zero in an integer linear recurrent sequence is NP-hard to decide |
scientific article |
Statements
The presence of a zero in an integer linear recurrent sequence is NP-hard to decide (English)
0 references
28 August 2002
0 references
Pisot's problem
0 references
minimal realization
0 references
max-plus rational series
0 references
NP-hard
0 references
discrete event systems
0 references
