We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial o...
Congpei An, Xiaojun Chen, Ian H. Sloan, Robert S. ...
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...