An upper bound on the number of relevant variables for Boolean functions on the Hamming graph

From MaRDI portal

Publication:6530769

Jump to:navigation, search

MaRDI QIDQ6530769arXivFDO

Authors Alexandr Valyuzhenich

This page was built for publication: An upper bound on the number of relevant variables for Boolean functions on the Hamming graph

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6530769&oldid=40055120"