Sciweavers

7 search results - page 1 / 2
» An extension of the bivariate chromatic polynomial
Sort
View
EJC
2010
13 years 6 months ago
An extension of the bivariate chromatic polynomial
Ilya Averbouch, Benny Godlin, Johann A. Makowsky
JCT
2008
86views more  JCT 2008»
13 years 6 months ago
On distinguishing trees by their chromatic symmetric functions
Let T be an unrooted tree. The chromatic symmetric function XT , introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of T . The subtre...
Jeremy L. Martin, Matthew Morin, Jennifer D. Wagne...
PDCAT
2009
Springer
14 years 24 days ago
Balanced Dense Polynomial Multiplication on Multi-Cores
Abstract— In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementati...
Marc Moreno Maza, Yuzhen Xie
CORR
2011
Springer
186views Education» more  CORR 2011»
13 years 1 months ago
On the Complexity of Solving a Bivariate Polynomial System
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
Pavel Emeliyanenko, Michael Sagraloff
JSC
2010
90views more  JSC 2010»
13 years 4 months ago
Modular Las Vegas algorithms for polynomial absolute factorization
Let f(X, Y ) ∈ Z[X, Y ] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely,...
Cristina Bertone, Guillaume Chèze, Andr&eac...