220 search results - page 2 / 44 » New degree bounds for polynomial threshold functions |
ECCC
2010
13 years 6 months ago
2010
In this paper we study the degree of non-constant symmetric functions f : {0, 1}n → {0, 1, . . . , c}, where c ∈ N, when represented as polynomials over the real numbers. We s...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
For an n-variate degree
FSTTCS
2001
Springer
13 years 12 months ago
2001
Springer
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 ⇐...
ECCC
2011
12 years 11 months ago
2011
We report on some initial results of a brute-force search for determining the maximum correlation between degree-d polynomials modulo p and the n-bit mod q function. For various s...