Complexity metric and structural measure on the class of deterministic matrices

MaRDI QIDQ3519845zbMATH OpenFDO

Authors M. Maria Susai Manuel, G. Britto Antony Xavier, L. Ravi

Publication date 19 August 2008

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Formal languages and automata (68Q45)

Recommendations

• Complexity metric and structural measure on the class of non deterministic matrices
• Kolmogorov's complexity for positive definite matrices
• The linear complexity of a graph
• Complexity measures of sign matrices
• Complexity measure by ordinal matrix growth modeling

Cited in

(8)

• Identifying complexity by means of matrices
• Complexity metric and structural measure on the class of non deterministic matrices
• Deterministic Constructions of Binary Measurement Matrices From Finite Geometry
• Prism complexity of matrices
• Kolmogorov's complexity for positive definite matrices
• Undirected determinant and its complexity
• The linear complexity of a graph
• Complexity measures of sign matrices

This page was built for publication: Complexity metric and structural measure on the class of deterministic matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519845)