The complexity of Boolean functions in different characteristics
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4012495
- On complexity of a particular Boolean functions class
- Computational complexity of Boolean functions
- scientific article; zbMATH DE number 4108153
- scientific article; zbMATH DE number 726918
- scientific article; zbMATH DE number 194333
- On the multiplicative complexity of Boolean functions
- scientific article; zbMATH DE number 176868
- On the complexity of restrictions of Boolean functions
- scientific article; zbMATH DE number 4035741
Cited in
(16)- Scalable zero knowledge via cycles of elliptic curves
- Behavior of Shannon functions for complexity of parametric representations of Boolean functions
- Complexity of some arithmetic problems for binary polynomials
- Critical properties and complexity measures of read-once Boolean functions
- Predicate encryption from bilinear maps and one-sided probabilistic rank
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 176868 (Why is no real title available?)
- scientific article; zbMATH DE number 2062211 (Why is no real title available?)
- Evaluation, Strength, and Relevance of Variables of Boolean Functions
- On computing Boolean connectives of characteristic functions
- Properties of Switch-List Representations of Boolean Functions
- Communication lower bounds using directional derivatives
- Book review of: S. Jukna, Boolean function complexity. Advances and frontiers.
- On the modulo degree complexity of Boolean functions
- On the modulo degree complexity of Boolean functions
- Boolean functions derived from Fermat quotients
This page was built for publication: The complexity of Boolean functions in different characteristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626677)
