Magnus Find

Available identifiers

zbMath Open find.magnus-gausdalMaRDI QIDQ725953

List of research outcomes

Publication	Date of Publication	Type
Improving \(3N\) circuit complexity lower bounds	2024-01-24	Paper
Better Circuits for Binary Polynomial Multiplication	2019-08-13	Paper
Small low-depth circuits for cryptographic applications	2019-01-08	Paper
The number of Boolean functions with multiplicative complexity 2	2018-08-02	Paper
Multiplicative complexity of vector valued Boolean functions	2018-03-12	Paper
On various nonlinearity measures for Boolean functions	2016-05-04	Paper
Separating OR, SUM, and XOR circuits	2016-04-18	Paper
Constructive relationships between algebraic thickness and normality	2015-09-29	Paper
Cancellation-free circuits in unbounded and bounded depth	2015-06-10	Paper
The relationship between multiplicative complexity and nonlinearity	2014-10-14	Paper
On the Complexity of Computing Two Nonlinearity Measures	2014-06-24	Paper
Cancellation-free circuits in unbounded and bounded depth	2013-08-16	Paper
Four measures of nonlinearity	2013-06-07	Paper

Research outcomes over time

This page was built for person: Magnus Find