1379 search results - page 31 / 276 » The Complexity of the Annihilating Polynomial |
DAM
2006
14 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
14 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
14 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...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...