Representing Boolean functions as polynomials modulo composite numbers
Computational Complexity1994Vol. 4(4), pp. 367–382
Citations Over TimeTop 1% of 1994 papers
Related Papers
- → The class number of $Q(\sqrt{-2p}) modulo 8, for $p\equiv5 \mod 8$ is prime(1981)3 cited
- → On the modulo degree complexity of Boolean functions(2018)3 cited
- → On the Modulo Degree Complexity of Boolean Functions(2017)1 cited
- → Computing All MOD-Functions Simultaneously(2012)
- → On the Complexity of Boolean Functions in Different Characteristics(2009)