75 search results - page 1 / 15 » Definability of Combinatorial Functions and Their Linear Rec... |
20
Voted
BIRTHDAY
2010
Springer
14 years 8 days ago
2010
Springer
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the co...
COMBINATORICS
2007
13 years 11 months ago
2007
We show that the generating function (in n) for the number of walks on the square lattice with steps (1, 1), (1, −1), (2, 2) and (2, −2) from (0, 0) to (2n, 0) in the region 0...
AAECC
2006
Springer
13 years 11 months ago
2006
Springer
We describe a complete algorithm to compute the hypergeometric solutions of linear recurrence relations with rational function coefficients. We use the notion of finite singularit...
CONSTRAINTS
2008
13 years 11 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...