2430 search results - page 115 / 486 » Computing Tutte Polynomials |
139
Voted
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We construct an explicit polynomial f(x1, . . . , xn), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least ...
118
click to vote
ICTAC
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Differing from [6] this paper reduces non-linear ranking function discovering for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the...
122
Voted
ARITH
2003
IEEE
15 years 10 months ago
2003
IEEE
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose orde...
162
click to vote
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
150
click to vote
CORR
2006
Springer
15 years 5 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...