Pages that link to "Item:Q3547908"
From MaRDI portal
The following pages link to On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns (Q3547908):
Displaying 14 items.
- The finite-step realizability of the joint spectral radius of a pair of \(d \times d\) matrices one of which being rank-one (Q445812) (← links)
- Unavoidable sets of partial words (Q733729) (← links)
- Overlap-free words and spectra of matrices (Q837157) (← links)
- Testing avoidability on sets of partial words is hard (Q1006080) (← links)
- Finiteness property of pairs of \(2\times 2\) sign-matrices via real extremal polytope norms (Q1044575) (← links)
- Exact computation of joint spectral characteristics of linear operators (Q1946589) (← links)
- Non-Sturmian sequences of matrices providing the maximum growth rate of matrix products (Q2081841) (← links)
- On the finiteness property for rational matrices (Q2483265) (← links)
- Efficient algorithms for deciding the type of growth of products of integer matrices (Q2483266) (← links)
- Regular Sequences and the Joint Spectral Radius (Q4977891) (← links)
- The Barabanov Norm is Generically Unique, Simple, and Easily Computed (Q5096053) (← links)
- Continuity properties of the lower spectral radius (Q5175033) (← links)
- Stability of Linear Problems: Joint Spectral Radius of Sets of Matrices (Q5261582) (← links)
- Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes (Q5281579) (← links)
