Finding the subsets of variables of a partial Boolean function which are sufficient for its implementation in the classes defined by predicates

DOI10.33048/daio.2020.27.664zbMath1491.68090OpenAlexW4255727070MaRDI QIDQ5090147

N. G. Parvatov

Publication date: 15 July 2022

Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/da946

zbMATH Keywords

partial Boolean functionWalsh-Hadamard transformMöbius transformsufficient subset of variables

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Boolean functions (06E30)

Cites Work

• Fast correlation decoding of Reed-Muller codes
• Logical semirings and their usage for construction of quick algorithms
• A method of constructing fast algorithms in the k-valued logic
• Fast multiplication of large numbers
• Fast Integer Multiplication Using Modular Arithmetic
• Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time
• Fast correlation decoding of some word subsets of the first order Reed-Muller code
• Generalizations of bent functions. A survey
• Fast Fourier-Hadamard decoding of orthogonal codes
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding the subsets of variables of a partial Boolean function which are sufficient for its implementation in the classes defined by predicates