Boolean Functions With Large Distance to All Bijective Monomials: N Odd Case

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-45537-x_4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Approximating the Distance to Monotonicity of Boolean Functions

2020English

Constructions of Generalized Bent Boolean Functions on Odd Number of Variables

International Journal of Hybrid Information Technology
Computer Science
2015English

Cryptographic Boolean Functions With R

R Journal
UncertaintyNumerical AnalysisStatisticsProbability
2011English

Counting Boolean Functions With Faster Points

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

Bi-Decomposing Large Boolean Functions via Interpolation and Satisfiability Solving

2008English

Odd Starlike Functions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1985English

Large N Correlation Functions N $$ \Mathcal{N} $$ = 2 Superconformal Quivers

Journal of High Energy Physics
High Energy PhysicsNuclear
2017English

Classes of Boolean Functions With Limited Complexity

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

A O(d) · Polylog N Monotonicity Tester for Boolean Functions Over the Hypergrid [N]d

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy