Most Complex Boolean Functions Detected by the Specialized Normal Form

Facta universitatis - series: Electronics and Energetics
doi 10.2298/fuee0703259s
Full Text
Abstract

Available in full text

Date
Authors
Publisher

National Library of Serbia

Related search

Modeling Soil Surface Roughness by Boolean Random Functions

Microscopy Microanalysis Microstructures
1996English

Approximation of Plateaued Boolean Functions by Monomial Ones

Prikladnaya Diskretnaya Matematika
Signal ProcessingCombinatoricsApplied MathematicsMathematicsDiscrete MathematicsComputational TheoryTheoretical Computer Science
2008English

The Algebraic Immunity of Boolean Functions

Prikladnaya Diskretnaya Matematika
Signal ProcessingCombinatoricsApplied MathematicsMathematicsDiscrete MathematicsComputational TheoryTheoretical Computer Science
2008English

About the Cubic Part of the Algebraic Normal Form of Arbitrary Bent Functions

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

Cryptographic Boolean Functions With R

R Journal
UncertaintyNumerical AnalysisStatisticsProbability
2011English

Dirichlet Product for Boolean Functions

Journal of Applied Mathematics and Computing
Computational MathematicsApplied Mathematics
2016English

The Monotone Circuit Complexity of Boolean Functions

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1987English

Distributivity and the Normal Completion of Boolean Algebras

Pacific Journal of Mathematics
Mathematics
1958English

Counting Boolean Functions With Faster Points

Designs, Codes, and Cryptography
CombinatoricsApplied MathematicsComputer Science ApplicationsTheoretical Computer ScienceDiscrete Mathematics
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy