Refining the upper bound for the cardinality of the definition domain of universal functions for a class of linear Boolean functions

DOI10.3103/S0278641919040095zbMath1446.06023OpenAlexW2996715959WikidataQ126585071 ScholiaQ126585071MaRDI QIDQ2191017

A. A. Voronenko, I. A. Karchmit

Publication date: 23 June 2020

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641919040095

zbMATH Keywords

Boolean functionlinear functionuniversal function

Mathematics Subject Classification ID

Boolean functions (06E30) Boolean functions (94D10)

Related Items (1)

Universal functions for linear functions depending on two variables

Cites Work

• On the approximate bilinear complexity of matrix multiplication
• Lower estimate for the cardinality of the domain of universal functions for the class of linear Boolean functions
• On universal functions for the set of linear functions

This page was built for publication: Refining the upper bound for the cardinality of the definition domain of universal functions for a class of linear Boolean functions