1368 search results - page 48 / 274 » Generalized Rook Polynomials |
178
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
136
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
A new class of nonparametric algorithms for high-dimensional binary classification is proposed using cascades of low dimensional polynomial structures. Construction of polynomial ...
199
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
134
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
We consider the implications of the equivalence of commutative semifields of odd order and planar Dembowski-Ostrom polynomials. This equivalence was outlined recently by Coulter an...
162
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...