An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations

IEEE Transactions on Information Theory - United States
doi 10.1109/tit.2009.2027520
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

On Sequences Defined by Linear Recurrence Relations

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1931English

MINREACT: An Efficient Algorithm for Identifying Minimal Metabolic Networks

2020English

Quadratically Convergent Algorithm for Computing Real Root of Non-Linear Transcendental Equations

BMC Research Notes
BiochemistryMedicineGeneticsMolecular Biology
2018English

An Almost Optimal Algorithm for Computing Nonnegative Rank

2013English

An Algorithm for Computing the Distance to Uncontrollability

Systems and Control Letters
ControlSystems EngineeringMechanical EngineeringElectronic EngineeringElectricalComputer Science
1991English

An Optimal Algorithm for Computing Visibility in the Plane

SIAM Journal on Computing
MathematicsComputer Science
1995English

CT-EXT: An Algorithm for Computing Typical Testor Set

English

An Algorithm for Determining Defining Relations of a Subgroup

Glasgow Mathematical Journal
Mathematics
1977English

Decision Problems for Linear Recurrence Sequences

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy