The presence of a zero in an integer linear recurrent sequence is NP-hard to decide (Q1611897)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1790276
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The presence of a zero in an integer linear recurrent sequence is NP-hard to decide |
scientific article; zbMATH DE number 1790276 |
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
0.8573623895645142
0 references
0.7869590520858765
0 references
0.7752644419670105
0 references
0.761984646320343
0 references
0.7432207465171814
0 references
