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

From MaRDI portal
Publication:1611897


DOI10.1016/S0024-3795(01)00466-9zbMath1007.93047MaRDI QIDQ1611897

Blondel, Vincent D., Natacha Portier

Publication date: 28 August 2002

Published in: Linear Algebra and its Applications (Search for Journal in Brave)


93C65: Discrete event control/observation systems

93B20: Minimal systems representations

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)


Related Items



Cites Work