220 search results - page 3 / 44 » New degree bounds for polynomial threshold functions |
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...
FOCS
2003
IEEE
14 years 22 days ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
MOC
1998
13 years 7 months ago
1998
We give bounds for the coefficients of a polynomial as functions of the diameter of its roots, hence we obtain polynomials with minimal diameters and small degree
AUTOMATICA
2005
13 years 7 months ago
2005
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...