scientific article; zbMATH DE number 1396670

zbMATH Open0931.68082MaRDI QIDQ4936628FDOQ4936628

Yuri Vladimirovich Merekin

Publication date: 31 January 2000

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

Recommendations

• scientific article; zbMATH DE number 1564048
• scientific article; zbMATH DE number 1855659
• scientific article; zbMATH DE number 1432161
• Upper bounds for the complexity of sequences generated by symmetric Boolean functions
• scientific article; zbMATH DE number 1285633

zbMATH Keywords

complexitycombinatorics on wordsBoolean functionconcatenation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tight bounds for the multiplicative complexity of symmetric functions
• Upper bounds for the complexity of sequences generated by symmetric Boolean functions
• On the multiplicative complexity of binary words with a given number of units.

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 Q4936628)