1368 search results - page 77 / 274 » Generalized Rook Polynomials |
139
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
121
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
172
click to vote
WAOA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
119
click to vote
IPMI
2001
Springer
16 years 5 months ago
2001
Springer
Event-related functional magnetic resonance imaging (fMRI) is considered as an estimation and reconstruction problem. A linear model of the fMRI system based on the Fourier sampler...
142
click to vote
ASIACRYPT
2004
Springer
15 years 9 months ago
2004
Springer
The “XL-algorithm” is a computational method to solve overdetermined systems of polynomial equations which is based on a generalization of the well-known method of linearizatio...