Naga Ayachitula, Melissa Buco, et al.
SCC 2007
Paper
Improved LP lower bounds for difference triangle sets
Abstract
In 1991 Lorentzen and Nilsen showed how to use linear programming to prove lower bounds on the size of difference triangle sets. In this note we show how to improve these bounds by including additional valid linear inequalities in the LP formulation. We also give some new optimal di erence triangle sets found by computer search.
Related
Conference paper
Characterization of line width variation
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
W.C. Tang, H. Rosen, et al.
SPIE Optics, Electro-Optics, and Laser Applications in Science and Engineering 1991
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology