Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1855659

From MaRDI portal
Publication:4788069
Jump to:navigation, search

zbMATH Open1009.68104MaRDI QIDQ4788069FDOQ4788069


Authors: Yuri Vladimirovich Merekin Edit this on Wikidata


Publication date: 19 January 2003



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



Recommendations

  • Publication:4936628
  • scientific article; zbMATH DE number 1564048
  • On the multiplicative complexity of binary words with a given number of units.
  • scientific article; zbMATH DE number 1432161
  • Upper bounds for the complexity of sequences generated by symmetric Boolean functions


zbMATH Keywords

complexitycombinatorics on wordsBoolean functionconcatenation


Mathematics Subject Classification ID

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



Cited In (2)

  • Title not available (Why is that?)
  • 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 Q4788069)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4788069&oldid=19084331"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 00:18. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki