scientific article; zbMATH DE number 6466091

zbMATH Open1324.68073MaRDI QIDQ5264733FDOQ5264733

Yuri Vladimirovich Merekin

Publication date: 27 July 2015

Full work available at URL: http://mathnet.ru/eng/da767

Title of this publication is not available (Why is that?)

Recommendations

• The Shannon function for calculating the Arnold complexity of length 2 n binary words
• 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
• High-accuracy bounds of the Shannon function for formula complexity in bases with direct and iterative variables
• Behavior of Shannon functions for complexity of parametric representations of Boolean functions
• Refined bounds on Shannon's function for complexity of circuits of functional elements
• scientific article; zbMATH DE number 3954821
• 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 word

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics on words (68R15)

Cited In (1)

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

This page was built for publication:

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