The presence of a zero in an integer linear recurrent sequence is NP-hard to decide (Q1611897): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4304869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set of realizations of a max-plus linear sequence is semi-polyhedral / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of stability and controllability of elementary hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suites récurrentes linéaires. Propriétés algébriques et arithmétiques. (Linear recurrent sequences. Algebraic and arithmetic properties) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-event dynamic systems: The strictly convex case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the boolean minimal realization problem in the max-plus algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal realization in the max algebra is an extended linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods and applications of (max,+) linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal (max,+) Realization of Convex Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some reachability problems for a system on a finite group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata Studies. (AM-34) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zeros of Z-rational functions and DOL equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definition of a family of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3717120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of computational complexity results in systems and control / rank
 
Normal rank

Latest revision as of 16:13, 4 June 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
    0 references
    0 references
    28 August 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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