1998 search results - page 56 / 400 » Complexity of the Cover Polynomial |
MOC
2000
13 years 9 months ago
2000
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
DAM
2006
13 years 10 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
d Abstract) Frederic Bihan∗ Joel Gomez† Andrew Niles‡ J. Maurice Rojas§ January 24, 2007 Rojas dedicates this paper to his friend, Professor Tien-Yien Li. Consider real biv...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...