1368 search results - page 48 / 274 » Generalized Rook Polynomials |
CORR
2010
Springer
14 years 8 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...
ICML
2004
IEEE
16 years 20 days 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 ...
112
click to vote
CADE
2009
Springer
16 years 14 days 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...
DCC
2007
IEEE
15 years 11 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...
FOCS
2008
IEEE
15 years 6 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...