1380 search results - page 49 / 276 » A General Polynomial Sieve |
105
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
ISSAC
2004
Springer
15 years 7 months ago
2004
Springer
We present a subresultant-based algorithm for deciding if the parametrization of a toric hypersurface is invertible or not, and for computing the inverse of the parametrization in...
113
click to vote
CORR
2010
Springer
14 years 10 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 2 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 ...
126
click to vote
CADE
2009
Springer
16 years 2 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...