119 search results - page 1 / 24 » Two Structural Results for Low Degree Polynomials and Applic... |
CORR
2010
Springer
13 years 4 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...
COCO
2010
Springer
13 years 8 months ago
2010
Springer
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
APAL
2010
13 years 4 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
AAECC
2000
Springer
13 years 4 months ago
2000
Springer
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...