The following pages link to Magnus Gausdal Find (Q725953):
Displaying 14 items.
- (Q269489) (redirect page) (← links)
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- On various nonlinearity measures for Boolean functions (Q276554) (← links)
- The number of Boolean functions with multiplicative complexity 2 (Q725955) (← links)
- Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
- Small low-depth circuits for cryptographic applications (Q1755189) (← links)
- Cancellation-free circuits in unbounded and bounded depth (Q2348031) (← links)
- Cancellation-Free Circuits in Unbounded and Bounded Depth (Q2842782) (← links)
- The Relationship between Multiplicative Complexity and Nonlinearity (Q2922602) (← links)
- Constructive Relationships Between Algebraic Thickness and Normality (Q2947873) (← links)
- Four Measures of Nonlinearity (Q4924638) (← links)
- On the Complexity of Computing Two Nonlinearity Measures (Q4981157) (← links)
- Better Circuits for Binary Polynomial Multiplication (Q5228929) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
