Sciweavers

FSTTCS
2001
Springer
14 years 3 months ago
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F(x) ≡ P(x) (mod M) for all x ∈ {0, 1}n . Similarly, P one-sidedly M -represents F if F(x) = 0 ⇐...
Erion Plaku, Igor Shparlinski