scientific article; zbMATH DE number 1564048

zbMATH Open0956.68118MaRDI QIDQ4528868FDOQ4528868

Authors: Yuri Vladimirovich Merekin 

Publication date: 12 February 2001

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

Recommendations

• Publication:4936628
• Upper bounds for the complexity of sequences generated by symmetric Boolean functions
• scientific article; zbMATH DE number 1285633
• scientific article; zbMATH DE number 609985
• scientific article; zbMATH DE number 1432161

zbMATH Keywords

complexitycombinatorics on wordsBoolean functionconcatenation

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper bounds for the complexity of sequences generated by symmetric Boolean functions
• Title not available (Why is that?)
• A Lower Bound on the Expected Complexity in the Set of n-Tuples of Given Weight

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