The Shannon function for calculating the Arnold complexity of length 2 n binary words

DOI10.1134/S1990478913020129zbMATH Open1324.05003OpenAlexW2084657950MaRDI QIDQ5263796FDOQ5263796

Yuri Vladimirovich Merekin

Publication date: 17 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478913020129

Recommendations

• scientific article; zbMATH DE number 6466091
• On the computation of Arnold complexity of length \(2^{n}\) binary words
• Fast computation of the Arnold complexity of length \(2^{n}\) binary words
• On the computational complexity of the Arnold complexity of binary words
• Behavior of Shannon functions for complexity of parametric representations of Boolean functions
• scientific article; zbMATH DE number 3954821
• High-accuracy bounds of the Shannon function for formula complexity in bases with direct and iterative variables
• Refined bounds on Shannon's function for complexity of circuits of functional elements
• Orders of growth of Shannon functions for circuit complexity over infinite bases
• On the Shannon function for the generation of Boolean matrices

zbMATH Keywords

Shannon functionbinary wordArnold complexitycomplexity of words

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: The Shannon function for calculating the Arnold complexity of length 2 n binary words

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