Pages that link to "Item:Q626677"
From MaRDI portal
The following pages link to The complexity of Boolean functions in different characteristics (Q626677):
Displaying 4 items.
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Predicate encryption from bilinear maps and one-sided probabilistic rank (Q2175910) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- On the modulo degree complexity of Boolean functions (Q5918108) (← links)
