William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
The continuous mixing set is S = {(s, r, z) ∈ ℜ × ℜ+n × Zn : s + rj + wj zj ≥ fj, j = 1, ..., n}, where w1, ..., wn > 0 and f1, ..., fn ∈ ℜ. Let m = | {w1, ..., wn} |. We show that when w1 | ⋯ | wn, optimization over S can be performed in time O (nm + 1), and in time O (n log n) when w1 = ⋯ = wn = 1. © 2008 Elsevier B.V. All rights reserved.
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences