Sciweavers

FSTTCS
2001
Springer

On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems

14 years 2 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 ⇐⇒ P(x) ≡ 0 (mod M) for all x ∈ {0, 1}n . Lower bounds are obtained on the degree and the number of monomials of polynomials over ZZM , which strongly or one-sidedly M -represent the Boolean function deciding if a given nbit integer is square-free. Similar lower bounds are also obtained for polynomials over the reals which provide a threshold representation of the above Boolean function.
Erion Plaku, Igor Shparlinski
Added 28 Jul 2010
Updated 28 Jul 2010
Type Conference
Year 2001
Where FSTTCS
Authors Erion Plaku, Igor Shparlinski
Comments (0)