725 search results - page 63 / 145 » Bounding Degrees on RPL |
144
click to vote
STOC
2012
ACM
13 years 3 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
104
Voted
ISSAC
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we give a necessary and sufficient condition for an algebraic ODE to have an algebraic general solution. For an autonomous first order ODE, we give an optimized bo...
97
Voted
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
110
Voted
CSR
2006
Springer
15 years 4 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
72
Voted
AAECC
1995
Springer
15 years 4 months ago
1995
Springer
In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated i...