1368 search results - page 13 / 274 » Generalized Rook Polynomials |
SODA
2000
ACM
13 years 9 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
COCO
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we give reconstruction algorithms for depth-3 arithmetic circuits with k multiplication gates (also known as ΣΠΣ(k) circuits), where k = O(1). Namely, we give an ...
ISSAC
1998
Springer
14 years 20 days ago
1998
Springer
The subresultant theory for univariate commutative polynomials is generalized to Ore polynomials. The generalization includes: the subresultant theorem, gap structure, and subresu...
MKM
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Recent work has detailed the conditions under which univariate Laurent polynomials have functional decompositions. This paper presents algorithms to compute such univaria...
DM
2008
13 years 7 months ago
2008
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying pS(x + y) = TU=S pT (x)pU (y). Using umbral calculus, we give a formula for t...