Pages that link to "Item:Q626677"
From MaRDI portal
The following pages link to The complexity of Boolean functions in different characteristics (Q626677):
Displaying 14 items.
- Boolean functions derived from Fermat quotients (Q662181) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Behavior of Shannon functions for complexity of parametric representations of Boolean functions (Q1851549) (← links)
- Complexity of some arithmetic problems for binary polynomials (Q1889852) (← links)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- Predicate encryption from bilinear maps and one-sided probabilistic rank (Q2175910) (← links)
- (Q3762226) (← links)
- (Q4036699) (← links)
- Evaluation, Strength, and Relevance of Variables of Boolean Functions (Q4490787) (← links)
- On computing Boolean connectives of characteristic functions (Q4835862) (← links)
- Properties of Switch-List Representations of Boolean Functions (Q5130011) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- Book review of: S. Jukna, Boolean function complexity. Advances and frontiers. (Q5890688) (← links)
- On the modulo degree complexity of Boolean functions (Q5918108) (← links)