Scholarlink

Abstract <p>The complexity of computing systems of linear Boolean functions by circuits in the linear basis <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11970_2025_7208_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="37" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{\oplus\}\)</EquationSource> <!--BMatMGU2570032Chashkin-m1--> </InlineEquation> is considered. A tight value of the complexity of the system of linear Boolean functions with a coefficient matrix coinciding with a Hadamard matrix is established.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On the Complexity of One System of Linear Boolean Functions

  • 期刊论文

  • 发表日期：

    2025年4月1日

查看全文
  • A. V. Chashkin

摘要

Abstract

The complexity of computing systems of linear Boolean functions by circuits in the linear basis \(\{\oplus\}\) is considered. A tight value of the complexity of the system of linear Boolean functions with a coefficient matrix coinciding with a Hadamard matrix is established.