( en | de | ru )

 

Disambiguation of "Find, Magnus Gausdal"

Author of the publication

copydeleteadd this publication to your clipboard
A better-than-3n lower bound for the circuit complexity of an explicit function.

, , , and . Electron. Colloquium Comput. Complex., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

August Find

Josef Find

Otto Findeisen

Wolfgang Findeiß

Dieter Findeisen

 

Other publications of authors with the same name

Cancellation-Free Circuits in Unbounded and Bounded Depth., and . FCT, volume 8070 of Lecture Notes in Computer Science, page 159-170. Springer, (2013)A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function., , , and . FOCS, page 89-98. IEEE Computer Society, (2016)A better-than-3n lower bound for the circuit complexity of an explicit function., , , and . Electron. Colloquium Comput. Complex., (2015)Constructive Relationships Between Algebraic Thickness and Normality., and . FCT, volume 9210 of Lecture Notes in Computer Science, page 106-117. Springer, (2015)The Relationship between Multiplicative Complexity and Nonlinearity., and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 130-140. Springer, (2014)The number of boolean functions with multiplicative complexity 2., , and . Int. J. Inf. Coding Theory, 4 (4): 222-236 (2017)On the Complexity of Computing Two Nonlinearity Measures.. CSR, volume 8476 of Lecture Notes in Computer Science, page 167-175. Springer, (2014)