1998 search results - page 66 / 400 » Complexity of the Cover Polynomial |
ACL
1990
13 years 11 months ago
1990
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they ...
DLT
2009
13 years 7 months ago
2009
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
JCT
2000
13 years 9 months ago
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
DISOPT
2007
13 years 10 months ago
2007
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
CORR
2010
Springer
13 years 10 months ago
2010
Springer
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...