69 search results - page 6 / 14 » The nearest polynomial of lower degree |
CIE
2010
Springer
14 years 9 days ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
COCO
2003
Springer
14 years 22 days ago
2003
Springer
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
DCC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
JACM
2000
13 years 7 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
TC
2008
13 years 7 months ago
2008
This paper examines the hardware implementation trade-offs when evaluating functions via piecewise polynomial approximations and interpolations for precisions of up to 24 bits. In ...