On the modulo degree complexity of Boolean functions

DOI10.1007/978-3-319-62389-4_32zbMATH Open1433.68174OpenAlexW2724336131MaRDI QIDQ5920159

Qian Li, Xiaoming Sun

Publication date: 23 October 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_32

Mathematics Subject Classification ID

Could not fetch data.

Related Items (3)

On the multiplicative complexity of Boolean functions and bitsliced higher-order masking ⋮ Diameter Versus Certificate Complexity of Boolean Functions ⋮ Title not available (Why is that?)

This page was built for publication: On the modulo degree complexity of Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5920159)