5981 search results - page 73 / 1197 » time 2006 |
87
Voted
COMBINATORICS
1999
15 years 11 days ago
1999
F. Murnaghan observed a long time ago that the computation of the decompositon of the Kronecker product (n-a,2,... ) (n-b,
JUCS
2010
14 years 11 months ago
2010
: The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.
64
Voted
RTAS
2006
IEEE
15 years 6 months ago
2006
IEEE
115
Voted
NETWORKS
2007
15 years 6 days ago
2007
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
IPL
2000
15 years 15 days ago
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...