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.664MaRDI QIDQ5090147zbMATHOpenAlexFDO

Authors 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

Walsh-Hadamard transformpartial Boolean functionMöbius transformsufficient subset of variables

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4187721
• On the complexity of realization of Boolean functions by formulas
• On Partial Classes Containig All Monotone and Zero‐Preserving Total Boolean Functions
• On the classification of Boolean functions.
• To the problem of expressibility in the algebra of partial Boolean functions

Cites work

• scientific article; zbMATH DE number 4172951 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 2095531 (Why is no real title available?)
• A method of constructing fast algorithms in the k-valued logic
• Approximation of plateaued Boolean functions by monomial ones
• Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time
• Fast Fourier-Hadamard decoding of orthogonal codes
• Fast correlation decoding of Reed-Muller codes
• Fast correlation decoding of some word subsets of the first order Reed-Muller code
• Fast integer multiplication using modular arithmetic
• Fast multiplication of large numbers
• Faster integer multiplication
• Logical semirings and their usage for construction of quick algorithms
• On the foundations of combinatorial theory I. Theory of M�bius Functions

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

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